Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles
From MaRDI portal
Publication:5134530
DOI10.22108/toc.2017.21473zbMath1463.05140OpenAlexW2738994342MaRDI QIDQ5134530
Mohammad Hossein Ghaffari, Zohreh Mostaghim
Publication date: 17 November 2020
Full work available at URL: https://doaj.org/article/097fdc6195a445da9d8a5e2a386de594
Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)
Cites Work
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- Vertex reconstruction in Cayley graphs
- Error graphs and the reconstruction of elements in groups
- On the diameter of Cayley graphs of the symmetric group
- A strong generating test and short presentations for permutation groups
- On the diameter of permutation groups
- An algorithm for solving the factorization problem in permutation groups
- Metric intersection problems in Cayley graphs and the Stirling recursion
- On reconstruction of signed permutations distorted by reversal errors
- ECONOMICAL GENERATING SETS FOR THE SYMMETRIC AND ALTERNATING GROUPS CONSISTING OF CYCLES OF A FIXED LENGTH