1 citations · 2 across the 8 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Arc-connectivity and super arc-connectivity of mixed Cayley digraph
Yuhu Liu, Jixiang Meng
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…
math.CO2014
On restricted edge-connectivity of half-transitive multigraphs
Yingzhi Tian, Jixiang Meng, Xing Chen
Let be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by , is the cardinality of a minimum edge-cut of . We call maximall…