✦ LIBER ✦

Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs

✍ Scribed by Koichi Wada; Kimio Kawaguchi; Yupin Luo

Book ID: 112205693
Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 741 KB
Volume: 18
Category: Article
ISSN: 0882-1666
DOI: 10.1002/scj.4690181106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal fault-tolerant routings with sma

Optimal fault-tolerant routings with small routing tables for k-connected graphs

✍ Koichi Wada; Wei Chen 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Graphs with valency k, edge connectivity

Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth

✍ V. Faber; J. Mycielski 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 561 KB

We prove thbt if k>3 and there exists a regular graph with valency k, edge ity k and chromatic index k +l, then there exists such a graph of any girth g 14. connectiv-G=(X.E)iscalledagraph ifXisafinitesetandEc {{xr,.x2)lx1, x2 E X and x1 # x2 ). We call X the set of vertices and E the set of edges o

A necessary and sufficient condition for

A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian

✍ Zhou Huai-Lu 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB 👁 2 views

We prove the following conjecture of Broersma and Veldman: A connected, locally k-connected K,,-free graph is k-hamiltonian if and only if it is (k + 2)-connected ( k L 1). We use [ 11 for basic terminology and notation, and consider simple graphs only. Let G be a graph. By V(G) and E(G) we denote,

2-Reducible Two Paths and an Edge Constr

2-Reducible Two Paths and an Edge Constructing a Path in (2k+ 1)-Edge-Connected Graphs

✍ Haruko Okamura 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 606 KB

The existence of a 2-factor in K1, n-fre

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.