Edge-connectivity in regular multigraphs from eigenvalues

From MaRDI portal
Publication:5962474




Abstract: Let G be a d-regular multigraph, and let lambda2(G) be the second largest eigenvalue of G. In this paper, we prove that if lambda2(G)<fracd1+sqrt9d210d+174, then G is 2-edge-connected. Furthermore, for tge2 we show that G is (t+1)-edge-connected when lambda2(G)<dt, and in fact when lambda2(G)<dt+1 if t is odd.









This page was built for publication: Edge-connectivity in regular multigraphs from eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962474)