Geodesic
Cycles of length seven in the pancake graph
Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 5, pp. 46-55 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

It was proved that a cycle $C_l$ of length $l$, $6\leq l\leq n!$, can be embedded in the pancake graph $P_n$, $n\geq3$, that is the Cayley graph on the symmetric group with the generating set of all prefix-reversals. In this paper the characterization of cycles of length seven in this graph is given. It is proved that each of the vertices in $P_n$, $n\geq4$, belongs to $7(n-3)$ cycles of length seven, and there are exactly $n!(n-3)$ different cycles of length seven in the graph $P_n$, $n\geq4$. Ill. 1, tab. 1, bibliogr. 7.
Keywords: the pancake graph, Cayley graph, the symmetric group, cycle embedding. 
@article{DA_2010_17_5_a4,
     author = {E. V. Konstantinova and A. N. Medvedev},
     title = {Cycles of length seven in the pancake graph},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {46--55},
     year = {2010},
     volume = {17},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2010_17_5_a4/}
}
TY  - JOUR
AU  - E. V. Konstantinova
AU  - A. N. Medvedev
TI  - Cycles of length seven in the pancake graph
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2010
SP  - 46
EP  - 55
VL  - 17
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/DA_2010_17_5_a4/
LA  - ru
ID  - DA_2010_17_5_a4
ER  - 
%0 Journal Article
%A E. V. Konstantinova
%A A. N. Medvedev
%T Cycles of length seven in the pancake graph
%J Diskretnyj analiz i issledovanie operacij
%D 2010
%P 46-55
%V 17
%N 5
%U http://geodesic.mathdoc.fr/item/DA_2010_17_5_a4/
%G ru
%F DA_2010_17_5_a4
E. V. Konstantinova; A. N. Medvedev. Cycles of length seven in the pancake graph. Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 5, pp. 46-55. http://geodesic.mathdoc.fr/item/DA_2010_17_5_a4/

[1] Konstantinova E. V., “O khromaticheskom chisle nekotorykh grafov Keli”, Tr. VIII Mezhdunar. konf. “Diskretnye modeli v teorii upravlyayuschikh sistem”, FVMiK MGU im. M. V. Lomonosova, M., 2009, 149–155

[2] Kharari F., Teoriya grafov, Mir, M., 1973, 299 pp. | MR

[3] Dweighter H., “E 2569 in: Elementary problems and solutions”, Amer. Math. Monthly, 82:10 (1975), 1010 | DOI | MR

[4] Kanevsky A., Feng C., “On the embedding of cycles in pancake graphs”, Parallel comput., 21 (1995), 923–936 | DOI | MR | Zbl

[5] Asai S., Kounoike Y., Shinano Y., Kaneko K., “Computing the diameter of 17-pancake graph using a PC cluster”, Euro-Par 2006. Parallel Processing, Lect. Notes Comput. Sci., 4128, Springer-Verl., Berlin–Heidelberg, 2006, 1114–1124

[6] Sheu J. J., Tan J. J. M., Chu K. T., “Cycle embedding in pancake interconnection networks”, Proc. 23rd Workshop Comb. Math. Comput. Theory (Taiwan, 2006), Da-Yeh Univ. Press, Changhua, Taiwan, 2006, 85–92

[7] Zaks S., “A new algorithm for generation of permutations”, BIT, 24 (1984), 196–204 | DOI | MR | Zbl