arXiv · 2611.18193
Graphs attaining Haemers' toughness bound
Abstract
Haemers \cite{Haemers2020} conjectured that every connected noncomplete graph $G$ satisfies $t(G)\geqslantμ_2/(μ_n-δ)$, where $t(G)$ is the toughness of $G$, $μ_2$ and $μ_n$ are its algebraic connectivity and Laplacian spectral radius, and $δ$ is its minimum degree. Greaves and Zhu \cite{GreavesZhu2026} recently proved this conjecture, leaving the equality case open. We characterize all graphs attaining equality: a graph attains equality if and only if its complement has a complete component whose order is at least the Laplacian spectral radius of every other component. Equivalently, its algebraic connectivity and independence number sum to its order. We also determine all vertex cuts attaining the toughness, and show that for regular graphs, the equality graphs are exactly the complete multipartite graphs with parts of equal size.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yifan Li, Cheng Yeaw Ku. 2026-11-13. Graphs attaining Haemers' toughness bound. https://searcharxiv.com/abs/2611.18193
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.