In this paper, we consider the fault hamiltonicity and the fault hamiltonian connectivity of the pancake graph Moreover, all the bounds are optimal.
On the embedding of cycles in pancake graphs
โ Scribed by Arkady Kanevsky; Chao Feng
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 870 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 <
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.
## Abstract Let __G__ be a connected graph with edge set __E__ embedded in the surface โ. Let __G__ยฐ denote the geometric dual of __G__. For a subset __d__ of __E__, let ฯ__d__ denote the edges of __G__ยฐ that are dual to those edges of __G__ in __d__. We prove the following generalizations of wellโ