Abstract
Let G be a k-connected graph with k ⩾ 2. A hinge is a subset of k vertices whose deletion from G yields a disconnected graph. We consider the algebraic connectivity and Fiedler vectors of such graphs, paying special attention to the signs of the entries in Fielder vectors corresponding to vertices in a hinge, and to vertices in the connected components at a hinge. The results extend those in Fiedler’s papers Algebraic connectivity of graphs (1973), A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory (1975), and Kirkland and Fallat’s paper Perron Components and Algebraic Connectivity for Weighted Graphs (1998).
Similar content being viewed by others
References
R. B. Bapat, S. J. Kirkland, S. Pati: The perturbed Laplacian matrix of a graph. Linear Multilinear Algebra 49 (2001), 219–242.
R. B. Bapat, A. K. Lal, S. Pati: On algebraic connectivity of graphs with at most two points of articulation in each block. Linear Multilinear Algebra 60 (2012), 415–432.
R. B. Bapat, S. Pati: Algebraic connectivity and the characteristic set of a graph. Linear Multilinear Algebra 45 (1998), 247–273.
N. M. M. de Abreu: Old and new results on algebraic connectivity of graphs. Linear Algebra Appl. 423 (2007), 53–73.
M. Fiedler: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J. 25 (1975), 619–633.
M. Fiedler: Algebraic connectivity of graphs. Czech. Math. J. 23 (1973), 298–305.
S. Kirkland: Algebraic connectivity. Handbook of Linear Algebra (L. Hogben et al., eds.). Discrete Mathematics and Its Applications, Chapman & Hall/CRC, Boca Raton, 2007, pp. 36-1–36-12.
S. Kirkland, M. Neumann, B. L. Shader: Characteristic vertices of weighted trees via Perron values. Linear Multilinear Algebra 40 (1996), 311–325.
S. Kirkland, S. Fallat: Perron components and algebraic connectivity for weighted graphs. Linear Multilinear Algebra 44 (1998), 131–148.
R. Merris: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197–198 (1994), 143–176.
V. Nikiforov: The influence of Miroslav Fiedler on spectral graph theory. Linear Algebra Appl. 439 (2013), 818–821.
A. Pothen, H. D. Simon, K.-P. Liou: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11 (1990), 430–452.
Author information
Authors and Affiliations
Corresponding author
Additional information
Steve Kirkland’s research is supported in part by the University of Manitoba under grant 315729-352500-2000. This work is part of the doctoral studies of Israel Rocha, who acknowledges the partial support of CAPES. Vilmar Trevisan is partially supported by CNPq-Grants 305583/2012-3 and 481551/2012-3, by FAPERGS-Grant 11/1619-2, and by CAPES/DAAD Grant PROBRAL 408/13-Brazil.
Rights and permissions
About this article
Cite this article
Kirkland, S., Rocha, I. & Trevisan, V. Algebraic connectivity of k-connected graphs. Czech Math J 65, 219–236 (2015). https://doi.org/10.1007/s10587-015-0170-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-015-0170-9