On graphs with algebraic connectivity equal to minimum edge density

DOI10.1016/S0024-3795(02)00538-4zbMath1026.05075MaRDI QIDQ1414127

Shaun M. Fallat, Sukanta Pati, Stephen J. Kirkland

Publication date: 19 November 2003

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (12)

Upper bounds on algebraic connectivity via convex optimization ⋮ Old and new results on algebraic connectivity of graphs ⋮ A Spectral Approach to Network Design ⋮ Combinatorial Fiedler theory and graph partition ⋮ Complex Hadamard diagonalisable graphs ⋮ Unnamed Item ⋮ On Hadamard diagonalizable graphs ⋮ Bounds of Laplacian spectrum of graphs based on the domination number ⋮ On algebraic connectivity and spectral integral variations of graphs ⋮ Bounds on Laplacian eigenvalues related to total and signed domination of graphs ⋮ Signed (total) domination numbers and Laplacian spectrum of graphs ⋮ Cut ratios and Laplacian eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Laplace eigenvalues of graphs---a survey
• Eigenvalues, diameter, and mean distance in graphs
• Laplacian matrices of graphs: A survey
• The Laplacian Spectrum of a Graph
• Matrix Analysis
• Eigenvectors of acyclic matrices
• Perron components and algebraic connectivity for weighted graphs
• A survey of graph laplacians

This page was built for publication: On graphs with algebraic connectivity equal to minimum edge density