Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sharp spectral bounds for the edge-connectivity of a regular graph

Published 2 Oct 2018 in math.CO | (1810.01189v2)

Abstract: Let $\lambda_2(G)$ and $\kappa'(G)$ be the second largest eigenvalue and the edge-connectivity of a graph $G$, respectively. Let $d$ be a positive integer at least 3. For $t=1$ or 2, Cioaba proved sharp upper bounds for $\lambda_2(G)$ in a $d$-regular simple graph $G$ to guarantee that $\kappa'(G) \ge t+1$. In this paper, we settle down for all $t \ge 3$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Collections

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