Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles
In this paper, we extend upon the results of B. Suceav{u{a}} and R. Stong [Amer. Math. Monthly, 110 (2003) 162--162], which they computed the minimum number of 3-cycles needed to generate an even permutation. Let $Omega^n_{k,m}$ be the set of all permutations of the form $c_1 c_2 c...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2017-09-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://toc.ui.ac.ir/article_21473_2e07c04c5fad360f2c8b9fc03265c648.pdf |