✦ LIBER ✦

Embedding cycles in IEH graphs

✍ Scribed by Hung-Yi Chang; Rong-Jaye Chen

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 400 KB
Volume: 64
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00147-6

No coin nor oath required. For personal study only.

✦ Synopsis

We embed cycles into IEH graphs. First, IEH graphs are proved to be Hamiltonian except when they are of size 2" -1 for all n > 2. Next, we show that for an IEH graph of size N, an arbitrary cycle of even length N, where 3 < Ne < N is found. We also find an arbitrary cycle of odd length NO where 2 < NO < N if and only if a node of this graph has at least one forward 2-Inter-Cube (IC) edges. These results help describe the whole cycle structure in IEH graphs. @ 1997 Elsevier Science B.V.

📜 SIMILAR VOLUMES

Minimum bandwidth problem for embedding

Minimum bandwidth problem for embedding graphs in cycles

✍ Lin, Yixun 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views

For the bandwidth B(G) and the cyclic bandwidth B c (G) of a graph G, it is known that 1 2 B(G) °Bc (G) °B(G). In this paper, the criterion conditions for two extreme cases B c (G) Å B(G) and B c (G) Å 1 2 B(G) are studied. From this, some exact values of B c (G) for special graphs can be obtained.

On the embedding of cycles in pancake gr

On the embedding of cycles in pancake graphs

✍ Arkady Kanevsky; Chao Feng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Homogeneous Embeddings of Cycles in Grap

Homogeneous Embeddings of Cycles in Graphs

✍ Wayne Goddard; Michael A. Henning; Hiren Maharaj 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 163 KB

Cycle embedding in faulty wrapped butter

Cycle embedding in faulty wrapped butterfly graphs

✍ Chang-Hsiung Tsai; Tyne Liang; Lih-Hsing Hsu; Men-Yang Lin 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB

Nearly light cycles in embedded graphs a

Nearly light cycles in embedded graphs and crossing-critical graphs

✍ Mario Lomelí; Gelasio Salazar 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly light (that is, they have bounded length and at most one vertex of large degree). As an application, we show that every sufficiently large __k__‐crossing‐critical graph has crossing number a

Embedding graphs in Cayley graphs

✍ Chris D. Godsil; Wilfried Imrich 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 283 KB