Vertex trantisive graph with (very) small movement
Date:
Contributed talk in the Symmetries of Discrete Objects
University of Auckland
Auckland, New Zealand
Abstract: The motion of a graph is defined as the smallest number of vertices that are not fixed by a non-trivial automorphism. In the talk we will show a classification of the vertex transitive graphs whose motion is a prime number or a (very)small integer. We shall also explore how this problem connects with some classical permutation groups and graph theory problems.