arXiv:1409.6065 [math.CO]AbstractReferencesReviewsResources
Edge-connectivity in regular multigraphs from eigenvalues
Published 2014-09-22Version 1
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{9d^2-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.
Comments: 11 pages, 2 figures (in press, Linear Algebra and its Application)
Categories: math.CO
Tags: journal article
Related articles: Most relevant | Search more
arXiv:2412.19203 [math.CO] (Published 2024-12-26)
Connected triangle-free planar graphs whose second largest eigenvalue is at most 1
arXiv:2207.07536 [math.CO] (Published 2022-07-15)
The Edge-Connectivity of Vertex-Transitive Hypergraphs
arXiv:2211.03380 [math.CO] (Published 2022-11-07)
Graphs with second largest eigenvalue less than $1/2$