Maximally connected and super arcconnected BiCayley digraphs
Abstract
Let X=(V, E) be a digraph. X is maximally connected, if \kappa(X)=\delta(X). X is maximally arcconnected, if \lambda(X)=\delta(X). And X is super arcconnected, if every minimum arccut 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 BiCayley digraphs are maximally connected and maximally arcconnected, and the most of strongly connected BiCayley digraphs are super arcconnected.
 Publication:

arXiv eprints
 Pub Date:
 February 2014
 arXiv:
 arXiv:1402.4627
 Bibcode:
 2014arXiv1402.4627L
 Keywords:

 Mathematics  Combinatorics;
 05Cxx;
 F.2.2;
 G.2.2
 EPrint:
 11pages,0 figures