English

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

Combinatorics 2018-10-05 v2

Abstract

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

Keywords

Cite

@article{arxiv.1810.01189,
  title  = {Sharp spectral bounds for the edge-connectivity of a regular graph},
  author = {Suil O and Jongyook Park and Jeong Rye Park and Hyunju Yu},
  journal= {arXiv preprint arXiv:1810.01189},
  year   = {2018}
}

Comments

16 pages, corrected the typos, revised the proof of main theorem, updated the references

R2 v1 2026-06-23T04:25:43.939Z