SUFFICIENT CONDITIONS FOR EQUALITY OF CONNECTIVITY AND MINIMUM DEGREEOF A GRAPH

For a graph G, let n(G), kappa(G) and delta(G) denote the order, the c onnectivity, and the minimum degree of G, respectively. The paper cont ains some conditions on G implying kappa(G) = delta(G). One of the con ditions is that n(G) less than or equal to delta(G)(2p - 1)/(2p - 3) i f G is a p-partite graph. (C) 1993 John Wiley and Sons, Inc.