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 ...
An edge-connectivity proof is provided.