Edge-connectivity in regular multigraphs from eigenvalues
Combinatorics
2014-09-23 v1
Abstract
Let be a -regular multigraph, and let be the second largest eigenvalue of . In this paper, we prove that if , then is 2-edge-connected. Furthermore, for we show that is -edge-connected when , and in fact when if is odd.
Cite
@article{arxiv.1409.6065,
title = {Edge-connectivity in regular multigraphs from eigenvalues},
author = {Suil O},
journal= {arXiv preprint arXiv:1409.6065},
year = {2014}
}
Comments
11 pages, 2 figures (in press, Linear Algebra and its Application)