Algebraic connectivity of k-connected graphs

DOI10.1007/s10587-015-0170-9zbMath1363.05141OpenAlexW2468694328MaRDI QIDQ5249658

Vilmar Trevisan, Israel Rocha, Stephen J. Kirkland

Publication date: 6 May 2015

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/144223

zbMATH Keywords

algebraic connectivityFiedler vector

Mathematics Subject Classification ID

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

Related Items (4)

The algebraic connectivity of graphs with given circumference ⋮ Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity ⋮ Fiedler vector analysis for particular cases of connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The influence of Miroslav Fiedler on spectral graph theory
• Old and new results on algebraic connectivity of graphs
• Laplacian matrices of graphs: A survey
• The perturbed laplacian matrix of a graph
• On algebraic connectivity of graphs with at most two points of articulation in each block
• Characteristic vertices of weighted trees via perron values
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Perron components and algebraic connectivity for weighted graphs
• Algebraic connectivity and the characteristic set of a graph

This page was built for publication: Algebraic connectivity of k-connected graphs