Papers
Topics
Authors
Recent
Search
2000 character limit reached

Automorphisms of Cayley graphs on generalised dicyclic groups

Published 2 Oct 2013 in math.CO and math.GR | (1310.0618v1)

Abstract: A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian groups and generalised dicyclic groups. Indeed, any Cayley graph on such a group admits specific additional graph automorphisms that depend only on the group. Recently, Dobson and the last two authors showed that almost all Cayley graphs on abelian groups admit no automorphisms other than these obvious necessary ones. In this paper, we prove the analogous result for Cayley graphs on the remaining family of exceptional groups: generalised dicyclic groups.

Summary

Paper to Video (Beta)

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.

Collections

Sign up for free to add this paper to one or more collections.