On computing of a conditional edge connectivity of alternating group network
Yan‐Quan Feng, Rong‐Xia Hao, Jin‐Xin Zhou · Linear and Multilinear Algebra · 2017
An edge subset F of a connected graph G is called a k-restricted edge cut if is disconnected and every vertex in has at least k neighbours in . The cardinality of a minimum k-restricted edge-cut of G is called the k-restricted edge connectivity of G, denoted by . The alternating group network () is defined as the Cayley graph on the alternating group of degree n with respect to . In this paper, we prove that for each .