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

Abstract

Let λ2(G) and '(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 λ2(G) in a d-regular simple graph G to guarantee that '(G) t+1. In this paper, we settle down for all t 3.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…