Abstract

While it is easy to characterize the graphs on which a given transitive permutation groupG acts, it is very difficult to characterize the graphsX with Aut (X)=G. We prove here that for the certain transitive permutation groups a simple necessary condition is also sufficient. As a corollary we find that, whenG is ap-group with no homomorphism ontoZ p wrZ p , almost all Cayley graphs ofG have automorphism group isomorphic toG.

Links and resources

Tags

community

  • @ulpsch
  • @keinstein
  • @ks-plugin-devel
  • @dblp
@ks-plugin-devel's tags highlighted