Algebraic connectivity on a subclass of caterpillars

DOI10.1016/j.endm.2011.05.027zbMath1268.05126MaRDI QIDQ2840700

Vilmar Trevisan, Israel Rocha, Oscar Rojo

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.027

zbMATH Keywords

tree; total order; caterpillar; algebraic connectivity

Mathematics Subject Classification ID

05C05: Trees

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Ordering trees and graphs with few cycles by algebraic connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• Ordering trees with nearly perfect matchings by algebraic connectivity
• On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
• Ordering trees with algebraic connectivity and diameter
• The six classes of trees with the largest algebraic connectivity
• The ordering of trees and connected graphs by algebraic connectivity
• Characteristic vertices of weighted trees via perron values
• Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Eigenvalues and eigenvectors of tridiagonal matrices
• Ordering trees by algebraic connectivity