Sharp spectral bounds for the edge-connectivity of a regular graph
Combinatorics
2018-10-05 v2
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 .
Cite
@article{arxiv.1810.01189,
title = {Sharp spectral bounds for the edge-connectivity of a regular graph},
author = {Suil O and Jongyook Park and Jeong Rye Park and Hyunju Yu},
journal= {arXiv preprint arXiv:1810.01189},
year = {2018}
}
Comments
16 pages, corrected the typos, revised the proof of main theorem, updated the references