𝔖 Bobbio Scriptorium
✦   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

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 <

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