A note on limit points for algebraic connectivity

DOI10.1016/S0024-3795(02)00413-5zbMath1026.05077MaRDI QIDQ1414125

Stephen J. Kirkland

Publication date: 19 November 2003

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

Mathematics Subject Classification ID

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

Related Items (7)

Equitable decompositions of graphs with symmetries ⋮ Old and new results on algebraic connectivity of graphs ⋮ On limit points of Laplacian spectral radii of graphs ⋮ 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 ⋮ A survey of automated conjectures in spectral graph theory ⋮ On algebraic connectivity augmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian matrices of graphs: A survey
• The limit points of Laplacian spectra of graphs
• Characteristic vertices of weighted trees via perron values
• Perron components and algebraic connectivity for weighted graphs
• Extremizing algebraic connectivity subject to graph theoretic constraints

This page was built for publication: A note on limit points for algebraic connectivity