English

Edge-connectivity in regular multigraphs from eigenvalues

Combinatorics 2014-09-23 v1

Abstract

Let GG be a dd-regular multigraph, and let λ2(G)\lambda_2(G) be the second largest eigenvalue of GG. In this paper, we prove that if λ2(G)<d1+9d210d+174\lambda_2(G) < \frac{d-1+\sqrt{9d^2-10d+17}}4, then GG is 2-edge-connected. Furthermore, for t2t\ge2 we show that GG is (t+1)(t+1)-edge-connected when λ2(G)<dt\lambda_2(G)<d-t, and in fact when λ2(G)<dt+1\lambda_2(G)<d-t+1 if tt is odd.

Keywords

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)

R2 v1 2026-06-22T06:02:01.522Z