Edge-connectivity in regular multigraphs from eigenvalues
Abstract
Let G be a d-regular multigraph, and let λ2(G) be the second largest eigenvalue of G. In this paper, we prove that if λ2(G) < d-1+9d2-10d+174, then G is 2-edge-connected. Furthermore, for t2 we show that G is (t+1)-edge-connected when λ2(G)<d-t, and in fact when λ2(G)<d-t+1 if t is odd.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.