| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8897810 | Linear Algebra and its Applications | 2018 | 22 Pages |
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 [8].
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Jason J. Molitierno,