Six classes of trees with largest normalized algebraic connectivity

DOI10.1016/j.laa.2014.03.030zbMath1290.05105OpenAlexW1985241192WikidataQ112882256 ScholiaQ112882256MaRDI QIDQ2451679

Ji-Ming Guo, An Chang, Jian Xi Li, Wai Chee Shiu

Publication date: 4 June 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.03.030

zbMATH Keywords

treenormalized algebraic connectivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (5)

The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\) ⋮ On the second largest normalized Laplacian eigenvalue of graphs ⋮ Distance between the normalized Laplacian spectra of two graphs ⋮ On the second smallest and the largest normalized Laplacian eigenvalues of a graph ⋮ Normalized algebraic connectivity of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the normalized Laplacian spectra
• An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
• The six classes of trees with the largest algebraic connectivity
• The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges

This page was built for publication: Six classes of trees with largest normalized algebraic connectivity