On a diameter bound for Cayley graphs generated by transposition trees

zbMath1278.05121arXiv1106.5353MaRDI QIDQ2850064

Ashwin Ganesan

Publication date: 26 September 2013

Full work available at URL: https://arxiv.org/abs/1106.5353

zbMATH Keywords

permutationspermutation groupsdiameterCayley graphsinterconnection networkstransposition trees

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3

This page was built for publication: On a diameter bound for Cayley graphs generated by transposition trees