Cyclic arc-connectivity in a Cartesian p
β
Zhao Zhang; Yufang Zhu
π
Article
π
2010
π
Elsevier Science
π
English
β 319 KB
A digraph D is cycle separable if it contains two vertex disjoint directed cycles. For a cycle separating digraph D, an arc set S is a cycle separating arc-cut if D-S has at least two strong components containing directed cycles. The cyclic arc-connectivity Ξ» c (D) is the minimum cardinality of all