✦ LIBER ✦

Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs

✍ Scribed by Hong-Chun Hsu; Yi-Lin Hsieh; Jimmy J. M. Tan; Lih-Hsing Hsu

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 252 KB
Volume: 42
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10096

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Panconnectivity, fault-tolerant hamilton

Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

✍ Jou-Ming Chang; Jinn-Shyong Yang; Yue-Li Wang; Yuwen Cheng 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 274 KB

On the construction of combined k-fault-

On the construction of combined k-fault-tolerant Hamiltonian graphs

✍ Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

On the fault-tolerant diameter and wide

On the fault-tolerant diameter and wide diameter of ω-connected graphs

✍ Jian-Hua Yin; Jiong-Sheng Li; Guo-Liang Chen; Cheng Zhong 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 179 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.