✦ LIBER ✦

The restricted arc connectivity of Cartesian product digraphs

✍ Scribed by Xing Chen; Juan Liu; Jixiang Meng

Book ID: 108154664
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 160 KB
Volume: 109
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.08.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Restricted arc-connectivity of digraphs

✍ Lutz Volkmann 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Cyclic arc-connectivity in a Cartesian p

Cyclic arc-connectivity in a Cartesian product digraph

✍ 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

On cyclic vertex-connectivity of Cartesi

On cyclic vertex-connectivity of Cartesian product digraphs

✍ Da Huang, Zhao Zhang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 421 KB

On the restricted arc-connectivity ofs-g

On the restricted arc-connectivity ofs-geodetic digraphs

✍ Camino Balbuena; Pedro García-Vázquez 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 237 KB

On the super-restricted arc-connectivity

On the super-restricted arc-connectivity of s -geodetic digraphs

✍ Camino Balbuena; Pedro García-Vázquez; Adriana Hansberg; Luis Pedro Montejano 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

Connectivity of cartesian product digrap

Connectivity of cartesian product digraphs and fault-tolerant routings of generalized hypercube

✍ Xu Junming 📂 Article 📅 1998 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 463 KB