Sufficient conditions for equality of connectivity and minimum degree of a graph
Jerzy Topp, Lutz Volkmann · Journal of Graph Theory · 1993
Abstract For a graph G, let n(G), κ(G) and δ(G) denote the order, the connectivity, and the minimum degree of G, respectively. The paper contains some conditions on G implying κ(G) = δ(G). One of the conditions is that n(G) ≤ δ(G)(2p −1)/(2p −3) if G is a p‐partite graph. © 1993 John Wiley & Sons, Inc.