Generalized edge-connectivity of (n, k)-star graphs
Yunchao Wei, Minghua Liu · 2014
An edge subset B is h-super edge-cut of a connected graph G if G — В is disconnected, moreover every vertex has at least h neighbors in G — В. Minimum |В| of G is h-super edge-connectivity of G, denoted by λs(H)(G). In this paper, we determine λs(H)(Sn, k) for 0 ≤ h ≤ n − к, where Sn, kde-notes (n, k)-star graphs, so that we can get traditional edge-connectivity λ (Sn, k) and λs(Sn, k) and get edge-connectivity of n-star graphs Snwho is isomorphic to Sn, n−1. In fact, the conclusions of generalized edge-connectivity in the known graphs are few, so this work is very valuable.