Edge-connectivity in regular multigraphs from eigenvalues

preprint2014arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.