On the strictness of a bound for the diameter of Cayley graphs generated by transposition trees
From MaRDI portal
(Redirected from Publication:5867207)
Recommendations
- On the sharpness of a bound on the diameter of Cayley graphs generated by transposition trees
- Diameters of Cayley graphs generated by transposition trees
- Upper bounds for sorting permutations with a transposition tree
- On the diameter of permutation groups
- On the diameter of Cayley graphs of the symmetric group
Cites work
- A group-theoretic model for symmetric interconnection networks
- Algebraic Graph Theory
- Cayley graphs with optimal fault tolerance
- Factoring, into edge transposition of a tree, permutations fixing a terminal vertex
- Group Action Graphs and Parallel Architectures
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 30751 (Why is no real title available?)
- scientific article; zbMATH DE number 1054728 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 798638 (Why is no real title available?)
- Principles of combinatorics
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The complexity of finding minimum-length generator sequences
Cited in
(4)
This page was built for publication: On the strictness of a bound for the diameter of Cayley graphs generated by transposition trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5867207)