Arc-connectivity and super arc-connectivity of mixed Cayley digraph
Combinatorics
2014-02-21 v1
Abstract
A digraph X=(V, E) is max-\lambda, if \lambda(X)=\delta(X). A digraph X is super-\lambda if every minimum 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 for all but a few exceptions, the strongly connected mixed Cayley digraphs are max-\lambda and super-\lambda.
Keywords
Cite
@article{arxiv.1402.4944,
title = {Arc-connectivity and super arc-connectivity of mixed Cayley digraph},
author = {Yuhu Liu and Jixiang Meng},
journal= {arXiv preprint arXiv:1402.4944},
year = {2014}
}
Comments
25pages,9 figures