The largest Laplacian and adjacency indices of complete caterpillars of fixed diameter
A complete caterpillar is a caterpillar in which each internal vertex is a quasi-pendent vertex. In this paper, in the class of all complete caterpillars on n vertices and diameter d, the caterpillar attaining the largest Laplacian index is determined. In addition, it is proved that this caterpillar...
Guardado en:
Autores principales: | Abreu,Nair, Lenes,Eber, Rojo,Oscar |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2015
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000200006 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
An upper bound on the largest signless Laplacian of an odd unicyclic graph
por: Collao,Macarena, et al.
Publicado: (2012) -
New bounds on the distance Laplacian and distance signless Laplacian spectral radii
por: Díaz,Roberto C., et al.
Publicado: (2019) -
Computing the maximal signless Laplacian index among graphs of prescribed order and diameter
por: Abreu,Nair, et al.
Publicado: (2015) -
THE SPECTRUM OF THE LAPLACIAN MATRIX OF A BALANCED 2p-ARY TREE
por: ROJO,OSCAR
Publicado: (2004) -
Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P 2 and K n
por: Sardar,Muhammad Shoaib, et al.
Publicado: (2020)