Papers
Topics
Authors
Recent
Search
2000 character limit reached

Automorphisms of Cayley graphs generated by transposition sets

Published 24 Mar 2013 in cs.DM and math.CO | (1303.5974v2)

Abstract: Let SS be a set of transpositions such that the girth of the transposition graph of SS is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group HH generated by SS is the semidirect product $R(H) \rtimes \Aut(H,S)$, where R(H)R(H) is the right regular representation of HH and $\Aut(H,S)$ is the set of automorphisms of HH that fixes SS setwise. Furthermore, if the connected components of the transposition graph of SS are isomorphic to each other, then $\Aut(H,S)$ is isomorphic to the automorphism group of the line graph of the transposition graph of SS. This result is a common generalization of previous results by Feng, Ganesan, Harary, Mirafzal, and Zhang and Huang. As another special case, we obtain the automorphism group of the extended cube graph that was proposed as a topology for interconnection networks.

Authors (1)
Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.