On the Strictness of a Bound for the Diameter of Cayley Graphs Generated by Transposition Trees

DOI10.1007/978-3-642-28926-2_6zbMath1494.05034OpenAlexW2074270182MaRDI QIDQ5867207

Ashwin Ganesan

Publication date: 13 September 2022

Published in: Mathematical Modelling and Scientific Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28926-2_6

zbMATH Keywords

permutation groupsdiameterCayley graphsinterconnection networkstransposition trees

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of finding minimum-length generator sequences
• Factoring, into edge transposition of a tree, permutations fixing a terminal vertex
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Principles of combinatorics
• Group Action Graphs and Parallel Architectures
• A group-theoretic model for symmetric interconnection networks
• Algebraic Graph Theory
• Cayley graphs with optimal fault tolerance

This page was built for publication: On the Strictness of a Bound for the Diameter of Cayley Graphs Generated by Transposition Trees