Edge-Connectivity versus Lin--Lu--Yau Curvature

Abstract

We systematically explore the relationship between edge-connectivity and Lin--Lu--Yau curvature for graphs. The intuition is that a connected graph with large Lin--Lu--Yau curvature should also have large edge-connectivity, and vice versa under suitable conditions. We prove that the edge-connectivity of a connected graph is bounded lower by the product of its minimum degree, its Lin--Lu--Yau curvature and the constant $\frac{3}{2}$. We also provide two lower bounds on the edge-connectivity of a graph that guarantee positive Lin--Lu--Yau curvature, and discuss the sharpness of these bounds.