On computing of a conditional edge connectivity of alternating group network
On computing of a conditional edge connectivity of alternating group network
复制标题
交替群网络条件边连通性的计算
DOI：
10.1080/03081087.2016.1277689
复制
发表时间：
2017
影响因子：
1.1
通讯作者：
Jin-Xin Zhou
中科院分区：
文献类型：
--
作者：
Yan-Quan Feng;Rong-Xiao Hao;Jin-Xin Zhou
连通图G的边子集F称为k限制边割，如果G是不连通的，且中的每个顶点至少有k个邻点。图G的一个最小k-限制边割的基数称为G的k-限制边连通度，记为。交错群网络()定义为关于的n次交错群上的Cayley图。在这篇文章中，我们证明了每一个。
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 .