On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
From MaRDI portal
Publication:1044553
DOI10.1016/j.laa.2009.09.007zbMath1205.05152OpenAlexW2079581177MaRDI QIDQ1044553
Publication date: 18 December 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.09.007
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (8)
Graphs with maximum Laplacian and signless Laplacian Estrada index ⋮ The largest Laplacian and adjacency indices of complete caterpillars of fixed diameter ⋮ On the spectrum of finite, rooted homogeneous trees ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Line graph of combinations of generalized Bethe trees: Eigenvalues and energy ⋮ Line graph eigenvalues and line energy of caterpillars ⋮ Upper bounds on the Laplacian spread of graphs ⋮ Algebraic connectivity on a subclass of caterpillars
Cites Work
- Unnamed Item
- Old and new results on algebraic connectivity of graphs
- Ordering trees with nearly perfect matchings by algebraic connectivity
- Spectra of generalized Bethe trees attached to a path
- Algebraic connectivity and degree sequences of trees
- Laplacian matrices of graphs: A survey
- 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
- The Laplacian Spectrum of a Graph
- Spectra of weighted compound graphs of generalized Bethe trees
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Eigenvalues and eigenvectors of tridiagonal matrices
- Ordering trees by algebraic connectivity
- Matrix theory. Basic results and techniques
This page was built for publication: On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
