arXiv · 0909.2782
A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method
Abstract
In this paper a tight lower bound for algebraic connectivity of graphs (second smallest eigenvalue of the Laplacian matrix of the graph) based on connection-graph-stability method is introduced. The connection-graph-stability score for each edge is defined as the sum of the length of all the shortest paths making use of that edge. We prove that the algebraic connectivity of the graph is lower bounded by the size of the graph divided by the maximum connection graph stability of the edges.
Explore related subjects
Keep this discovery
Ali Ajdari Rad, Mahdi Jalili, Martin Hasler. 2009-09-15. A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method. https://arxiv.org/abs/0909.2782
Cite the original work for its findings. Save a collection to share your selection of sources.