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 <
β¦ LIBER β¦
Embedding of cycles in arrangement graphs
β Scribed by Day, K.; Tripathi, A.
- Book ID
- 119772062
- Publisher
- IEEE
- Year
- 1993
- Tongue
- English
- Weight
- 506 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0018-9340
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Embedding cycles in IEH graphs
β
Hung-Yi Chang; Rong-Jaye Chen
π
Article
π
1997
π
Elsevier Science
π
English
β 400 KB
On the embedding of cycles in pancake gr
β
Arkady Kanevsky; Chao Feng
π
Article
π
1995
π
Elsevier Science
π
English
β 870 KB
Embedding cycles of given length in orie
β
Daniela KΓΌhn; Deryk Osthus; Diana Piguet
π
Article
π
2013
π
Elsevier Science
π
English
β 246 KB
Minimum bandwidth problem for embedding
β
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.
Homogeneous Embeddings of Cycles in Grap
β
Wayne Goddard; Michael A. Henning; Hiren Maharaj
π
Article
π
1999
π
Springer Japan
π
English
β 163 KB
A note on embedding graphs without short
β
Agnieszka GΓΆrlich; Monika PilΕniak; Mariusz WoΕΊniak; Irmina A. ZioΕo
π
Article
π
2004
π
Elsevier Science
π
English
β 169 KB