A tight upper bound on the spectral radius of bottleneck matrices for graphs

作者：Molitierno Jason J^*

来源：Linear Algebra and Its Applications, 2018, 551: 1-17.

DOI：10.1016/j.laa.2018.03.044

• Laplacian matrix
• Bottleneck matrix
• Algebraic connectivity
• Vertex eccentricity

In this paper, we find a tight upper bound on the spectral radius of bottleneck matrices for graphs. We use this upper bound to find a tight lower bound on the algebraic connectivity of graphs in terms of the radius of the graph. We show that these lower bounds are an improvement on those found in [8].

• 出版日期2018-8-15