The smallest values of algebraic connectivity for trees

DOI10.1007/s10114-012-0350-6zbMath1255.05048OpenAlexW2039278542MaRDI QIDQ1928128

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

Publication date: 2 January 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-012-0350-6

zbMATH Keywords

orderingalgebraic connectivity

Mathematics Subject Classification ID

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

Related Items (4)

Absolute algebraic connectivity of double brooms and trees ⋮ On two conjectures of spectral graph theory ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The smallest values of algebraic connectivity for unicyclic graphs
• The algebraic connectivity of graphs under perturbation
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• Laplacian graph eigenvectors
• The ordering of trees and connected graphs by algebraic connectivity
• On the second largest Laplacian eigenvalue of trees

This page was built for publication: The smallest values of algebraic connectivity for trees