Algebraic connectivity of k-connected graphs

作者：Kirkland Steve^*; Rocha Israel; Trevisan Vilmar

来源：Czechoslovak Mathematical Journal, 2015, 65(1): 219-236.

DOI：10.1007/s10587-015-0170-9

• algebraic connectivity
• Fiedler vector

Let G be a k-connected graph with k a (c) 3/4 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).

• 出版日期2015-3