… automatic infinite transitive graphs that are not Cayley graphs… is an automatic transitive graph
such that no Cayley graph is … the class of automatic transitive graphs properly contains the …

… automatic … transitively on the vertex set and edge set, but not on the set of ordered pairs of
adjacent vertices of X. In this paper the author surveys some new results on 1-transitive graphs …

… is Cayley if and only if its automorphism group contains a regular subgroup. Suppose F is a
… Fç_1 so that (a) acts transitively on the blocks. We may define a cyclic permutation & on Zq …

… a set of graphs on the vertex their etlee tlirect eum is the graph G - (Vrgr") vlth … This graph
has degree 2. In $t1 we shall show that its autonorphfsn group ls transitive of ord'er 20, and' is …

… There are a number of ways of doing this and we argue for basing it on the graph of
relations between event boundaries. We aim to accomplish two things by doing so: to find a …

… its automorphism group O(T) is transitive on ordered pairs of adjacent vertices. Such graphs
… in comparison with graphs F for which G(T) is merely vertex transitive, about which one can …

… Introduction In [7] and [8], Tutte considered a vertex-transitive group of automorphisms of
a finite, connected, trivalent graph. He showed that if the stabilizer of a vertex is transitive on …

… 2 -transitive group actions on graphs of valency 4 is studied via the well known concept of
… subgroup of automorphisms. The symmetric genus of Y is defined to be the smallest genus …

… interested in vertex-transitive graphs, it makes no difference whether the graphs are loopless
or … on G gives all the graphs of p vertices each whose group of automorphisms is transitive. …

… Our ultimate goal is to automatically construct a graph that encodes ordering between … the
graph with its transitive closure. We continue greedily adding edges and applying transitive …