On adjacency-transitive graphs (Q1379989)

A graph automorphism of a graph \( \Gamma \) mapping each vertex of \( \Gamma \) onto itself or one of its neighbors is called an adjacency automorphism. An adjacency-transitive graph is a graph that possesses a vertex-transitive automorphism group generated by its adjacency automorphisms. In the first part of the paper, the relation between vertex-transitive, Cayley and adjacency-transitive graphs is investigated: quasiabelian Cayley graphs are shown to be adjacency-transitive; non-Cayley adjacency-transitive graphs, adjacency-transitive Cayley graphs that are not quasiabelian as well as Cayley graphs with no non-trivial adjacency automorphisms are constructed. The second half of the paper contains a classification of the cubic and four-valent adjacency-transitive graphs, all of which are isomorphic to Cayley graphs of abelian groups.