Sharp spectral bounds for the edge-connectivity of a regular graph
arXiv:1810.01189
Abstract
Let and be the second largest eigenvalue and the edge-connectivity of a graph , respectively. Let be a positive integer at least 3. For or 2, Cioaba proved sharp upper bounds for in a -regular simple graph to guarantee that . In this paper, we settle down for all .
16 pages, corrected the typos, revised the proof of main theorem, updated the references