An upper bound on the largest signless Laplacian of an odd unicyclic graph

We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.

Guardado en:
Detalles Bibliográficos
Autores principales: Collao,Macarena, Pizarro,Pamela, Rojo,Oscar
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2012
Materias:
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000100005
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.