The six classes of trees with the largest algebraic connectivity

DOI10.1016/j.dam.2007.08.014zbMath1137.05047OpenAlexW1991545340MaRDI QIDQ2476262

Li Zhang, Xi-Ying Yuan, Jia-yu Shao

Publication date: 18 March 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.014

zbMATH Keywords

treeLaplacian matrixalgebraic connectivitybottleneck matrix

Mathematics Subject Classification ID

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

Related Items (11)

Spectral Bounds for the Connectivity of Regular Graphs with Given Order ⋮ Ordering trees by algebraic connectivity ⋮ Six classes of trees with largest normalized algebraic connectivity ⋮ On two conjectures of spectral graph theory ⋮ On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph ⋮ On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Gluing of graph Laplacians and their spectra ⋮ Algebraic connectivity on a subclass of caterpillars ⋮ On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering ⋮ Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Laplacian spectral radius of a tree.
• On algebraic connectivity and spectral integral variations of graphs
• On the two conjectures of Graffiti
• The limit points of Laplacian spectra of graphs
• Ordering trees by their Laplacian spectral radii
• On the second largest Laplacian eigenvalue of trees
• Characteristic vertices of weighted trees via perron values
• Ordering trees by algebraic connectivity

This page was built for publication: The six classes of trees with the largest algebraic connectivity