2014/02/20 by Yuhu Liu, Liu, Yuhu, Jixiang Meng +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #G.2.2 #math.CO
paper · pdf · doi:10.48550/arxiv.1402.4944
25pages,9 figures
arxiv created 2014/02/20 · arxiv updated 2014/02/21
A digraph X=(V, E) is max-λ, if λ(X)=δ(X). A digraph X is super-λ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-λand super-λ.