✦ LIBER ✦

Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes

✍ Scribed by Sun-Yuan Hsieh; Che-Nan Kuo

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 302 KB
Volume: 53
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2006.10.033

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd. We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n = 1 or n (≥ 2) is even.

📜 SIMILAR VOLUMES

Fault-tolerant hamiltonian laceability o

Fault-tolerant hamiltonian laceability of hypercubes

✍ Chang-Hsiung Tsai; Jimmy J.M. Tan; Tyne Liang; Lih-Hsing Hsu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Strongly Hamiltonian laceability of the

Strongly Hamiltonian laceability of the even k-ary n-cube

✍ Chien-Hung Huang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 218 KB

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks can be viewed as the subclasses of the k-ary n-cubes include the cycle, the torus and the hypercube. A bipartite graph is Hamiltonian lac

Hamiltonian-laceability of star graphs

✍ Sun-Yuan Hsieh; Gen-Huey Chen; Chin-Wen Ho 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Hyper hamiltonian laceability of Cayley

Hyper hamiltonian laceability of Cayley graphs generated by transpositions

✍ Toru Araki 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

On the genus and connectivity of Hamilto

On the genus and connectivity of Hamiltonian graphs

✍ Richard A. Duke 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 675 KB

Every finite strongly connected digraph

Every finite strongly connected digraph of stability 2 has a Hamiltonian path

✍ C.C. Chen; P. Manalastas Jr. 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Two circuits C~ and C 2 in a digraph are called consistent circuits if and only if their intersection is either empty, a singleton or a subpath of both C~ and C 2. It is proved that Every finite strongly connected digraph of G of stability at most 2 is spanned by two consistent circuits. As a conseq