A Tight Upper Bound on the Spectral Radius of Bottleneck Matrices for Graphs
Document Type
Peer-Reviewed Article
Publication Date
8-15-2018
Abstract
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[9].
DOI
10.1016/j.laa.2018.03.044
Recommended Citation
Molitierno, J.J. (2018). A tight upper bound on the spectral radius of bottleneck matrices for graphs. Linear Algebra and its Applications, 551, 1-17. doi:10.1016/j.laa.2018.03.044
