|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2014, Volume 11, Pages 906–914
(Mi semr535)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Discrete mathematics and mathematical cybernetics
Small cycles in the star graph
Elena V. Konstantinovaab, Alexey N. Medvedevac a Sobolev Institute of Mathematics, 4, Koptyug av., 630090, Novosibirsk, Russia
b Novosibisk State University, 2, Pirogova st., 630090, Novosibirsk, Russia
c Central European University, Nador ut. 9, Budapest, 1051, Hungary
Abstract:
The Star graph is the Cayley graph on the symmetric group $Sym_n$ generated by the set of transpositions $\{(1 2),(1 3),\ldots,(1 n)\}$. These graphs are bipartite, they do not contain odd cycles but contain all even cycles with a sole exception $4$-cycles. We characterize all distinct $6$- and $8$-cycles by their canonical forms as products of generating elements. The number of these cycles in the Star graph is also given.
Keywords:
Cayley graphs; Star graph; cycle embedding; product of generating elements.
Received October 15, 2014, published December 3, 2014
Citation:
Elena V. Konstantinova, Alexey N. Medvedev, “Small cycles in the star graph”, Sib. Èlektron. Mat. Izv., 11 (2014), 906–914
Linking options:
https://www.mathnet.ru/eng/semr535 https://www.mathnet.ru/eng/semr/v11/p906
|
Statistics & downloads: |
Abstract page: | 285 | Full-text PDF : | 98 | References: | 52 |
|