A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method

Details A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method

2009-09-15

arxiv.org/abs/0909.2782v1

Mathematics

Spectral Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-555865