Show simple item record

An Upper Bound on The Largest Signless Laplacian of an Odd Unicyclic Graph

dc.creatorCollao, Macarenaes
dc.creatorPizarro, Pamelaes
dc.creatorRojo, Oscares
dc.date2012-01-29
dc.date.accessioned2025-03-31T13:17:52Z
dc.date.available2025-03-31T13:17:52Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1157
dc.identifier10.4067/S0716-09172012000100005
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/250942
dc.descriptionWe derive an upper bound on the largest signless Laplacian eigen­value of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained re­moving the edges of the unique cycle in the graph.es
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.en
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1157/1126
dc.rightsCopyright (c) 2012 Proyecciones. Journal of Mathematicsen
dc.sourceProyecciones (Antofagasta, On line); Vol. 31 No. 1 (2012); 39-49en
dc.sourceProyecciones. Revista de Matemática; Vol. 31 Núm. 1 (2012); 39-49es
dc.source0717-6279
dc.titleAn Upper Bound on The Largest Signless Laplacian of an Odd Unicyclic Graphes
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record