collaborators

1 paper

math.CO2026

Maximum spectral gap of regular graphs with bounded essential edge-connectivity

Yu Wang, Sanming Zhou

An edge-cut of a graph is said to be essential if its removal results in a graph with at least two non-trivial components. The essential edge-connectivity of a graph is the min…