What is KG graph?
What is KG graph? For a graph G which is not complete, the connectivity of G, denoted κ(G), is the minimum size of a cut set of G. If G is a connected, non-complete graph of order n, then 1 ≤ κ(G) ≤ n − 2. If G is disconnected, then κ(G) = 0. If […]