Geodesic
Hamilton Cycles in Restricted and Incomplete Rotator Graphs
Journal of Graph Algorithms and Applications, Tome 16 (2012) no. 4, pp. 785-810.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

The nodes of a rotator graph are the permutations of n, and an arc is directed from u to v if the first r symbols of u can be rotated one position to the left to obtain v. Restricted rotator graphs restrict the allowable rotations to r ∈ R for some R ⊆ {2,3,...,n}. Incomplete rotator graphs only include nodes whose final symbol is i ≤ m for a fixed maximum value m ∈ {1,2,...,n}. Restricted rotator graphs are directed Cayley graphs, whereas incomplete rotator graphs are not Cayley graphs. Hamilton cycles exist for rotator graphs (Corbett 1992), restricted rotator graphs with R={n−1,n} (Ruskey and Williams 2010), and incomplete rotator graphs for all m (Ponnuswamy and Chaudhary 1994). These previous results are based on sequence building operations that we name `reusing', `recycling', and `rewinding'. In this article, we combine these operations to create Hamilton cycles in rotator graphs that are (1) restricted by R={2,3,n}, (2) restricted by R={2,3,n−1,n} and incomplete for any m, and (3) restricted by R={n−2,n−1,n} and incomplete for any m. Result (1) is `optimal' since restricted rotator graphs are not strongly connected for R={3,n} when n is odd, and do not have Hamilton cycles for R={2,n} when n is even (Rankin 1944, Swan 1999). Similarly, we prove (3) is `optimal'. Our Hamilton cycles can be easily implemented for potential applications, and we provide O(1)-time algorithms that generate successive rotations for (1)-(3). 
@article{JGAA_2012_16_4_a0,
     author = {Brett Stevens and Aaron Williams},
     title = {Hamilton {Cycles} in {Restricted} and {Incomplete} {Rotator} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {785--810},
     publisher = {mathdoc},
     volume = {16},
     number = {4},
     year = {2012},
     doi = {10.7155/jgaa.00278},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00278/}
}
TY  - JOUR
AU  - Brett Stevens
AU  - Aaron Williams
TI  - Hamilton Cycles in Restricted and Incomplete Rotator Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2012
SP  - 785
EP  - 810
VL  - 16
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00278/
DO  - 10.7155/jgaa.00278
LA  - en
ID  - JGAA_2012_16_4_a0
ER  - 
%0 Journal Article
%A Brett Stevens
%A Aaron Williams
%T Hamilton Cycles in Restricted and Incomplete Rotator Graphs
%J Journal of Graph Algorithms and Applications
%D 2012
%P 785-810
%V 16
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00278/
%R 10.7155/jgaa.00278
%G en
%F JGAA_2012_16_4_a0
Brett Stevens; Aaron Williams. Hamilton Cycles in Restricted and Incomplete Rotator Graphs. Journal of Graph Algorithms and Applications, Tome 16 (2012) no. 4, pp. 785-810. doi : 10.7155/jgaa.00278. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00278/

Cité par Sources :