Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps

preprint2015arXivOpen access

Abstract

This paper deals with the Cayley graph Cay(Symn,Tn),\mathrm{Cay}(\mathrm{Sym}_n,T_n), where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. As the main result, we prove that Aut(Cay(Symn,Tn))(\mathrm{Cay}(\mathrm{Sym}_n,T_n)) is the product of the left translation group by a dihedral group Dn+1\mathsf{D}_{n+1} of order 2(n+1)2(n+1). The proof uses several properties of the subgraph ΓΓ of Cay(Symn,Tn)\mathrm{Cay}(\mathrm{Sym}_n,T_n) induced by the set TnT_n. In particular, ΓΓ is a 2(n−2)2(n-2)-regular graph whose automorphism group is Dn+1,\mathsf{D}_{n+1}, ΓΓ has as many as n+1n+1 maximal cliques of size 2,2, and its subgraph Γ(V)Γ(V) whose vertices are those in these cliques is a 33-regular, Hamiltonian, and vertex-transitive graph. A relation of the unique cyclic subgroup of Dn+1\mathsf{D}_{n+1} of order n+1n+1 with regular Cayley maps on Symn\mathrm{Sym}_n is also discussed. It is shown that the product of the left translation group by the latter group can be obtained as the automorphism group of a non-tt-balanced regular Cayley map on Symn\mathrm{Sym}_n.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.