Papers
Topics
Authors
Recent
Search
2000 character limit reached

Edge-connectivity in regular multigraphs from eigenvalues

Published 22 Sep 2014 in math.CO | (1409.6065v1)

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

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

  1. Suil O 

Collections

Sign up for free to add this paper to one or more collections.