If G is a graph of order n>=2 such that for all distinct nonadjacent vertices u and v,
then the edge-connectivity k1(G)=Deta(G), where Deta(G) is the least degree of G.
Proof. We use a theorem in the book: Graphs and Digraphs--G.Chartrand and L.Lesniak.
Theorem: If G is a ...
The expert provides graphs and digraphs for distinct nonadjacent vertices. An edge-connectivity proof is provided.