基于连通图稳定性方法的代数连通度下界
A Lower Bound for Algebraic Connectivity based on Connection Graph Stability Method
摘要:
基于连通图稳定性方法,给出了图的代数连通度(Laplacian矩阵的次小特征值)的一个紧下界。每条边的连接图稳定性得分被定义为使用该边的所有最短路径的长度之和。我们证明了图的代数连通度是由图的大小除以边的最大连通图稳定性的下界。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。