Résumé
The Pancake graph Pn,n⩾3, is a Cayley graph on the symmetric group generated by prefix-reversals. It is known that Pn contains any ℓ-cycle for 6 ⩽ ℓ⩽ n!. In this paper we construct a family of maximal (covering) sets of even independent (vertex-disjoint) cycles of lengths ℓ bounded by O(n2). We present the new concept of prefix-reversal Gray codes based on independent cycles which extends the known greedy prefix-reversal Gray code constructions given by Zaks and Williams. Cases of non-existence of codes based on the presented family of independent cycles are provided using the fastening cycle approach. We also give necessary condition for existence of greedy prefix-reversal Gray codes based on the independent cycles with arbitrary even lengths.
langue originale | Anglais |
---|---|
Pages (de - à) | 1965-1978 |
Nombre de pages | 14 |
journal | Graphs and Combinatorics |
Volume | 32 |
Numéro de publication | 5 |
Les DOIs | |
Etat de la publication | Publié - 1 sept. 2016 |
Modification externe | Oui |