2014/02/19 by Yuhu Liu, Liu, Yuhu, Jixiang Meng +1
Computer Science · Engineering · Mathematics · #Finite Group Theory Research #Interconnection Networks and Systems #acm:05Cxx #graph theory and CDMA systems #math.CO #msc:05Cxx
paper · pdf · doi:10.48550/arxiv.1402.4627
11pages,0 figures
arxiv created 2014/02/19 · arxiv updated 2014/02/20
Let X=(V, E) be a digraph. X is maximally connected, if κ(X)=δ(X). X is maximally arc-connected, if λ(X)=δ(X). And X is super arc-connected, if every minimum arc-cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that the strongly connected Bi-Cayley digraphs are maximally connected and maximally arc-connected, and the most of strongly connected Bi-Cayley digraphs are super arc-connected.