[114] László Babai. Vertex-transitive graphs and vertex-transitive maps. games: A randomized proof system and a hierarchy of complexity classes. On the orders of primitive groups with restricted nonabelian composition factors.

A complete classification is given for finite vertex-primitive and vertex-biprimitive s-transitive graphs for s ≥ 4. The classification involves the construction of new 4-transitive graphs, namely a graph of valency 14 admitting the Monster simple group M, and an infinite family of graphs of valency 5 admitting projective symplectic groups PSp(4, p) with p prime and p ≡ ±1 (mod 8). As a corolla...

Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k, L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and st(edge)-transitivity. In this paper we investigate star-transitive and st(edge)-transitive graphs by studying the structure of the vertex and edge stabilisers of suc...

We consider the lossless compression of vertex transitive graphs. An undirected graph G = (V, E) is called vertex transitive if for every pair of vertices x, y ∈ V , there is an automorphism σ of G, such that σ(x) = y. A result due to Sabidussi, guarantees that for every vertex transitive graph G there exists a graph mG (m is a positive integer) which is a Cayley graph. We propose as the compre...

An interesting fact is that almost all the connected 2-arc-transitive nonnormal Cayley graphs on nonabelian simple groups with small valency or prime (provided solvable vertex stabilizers) are alternating An. This naturally motivates study of for arbitrary valency. In this paper, we characterize automorphism such graphs. particular, show a non-complete (G,2)-arc-transitive graph G simple, socle...

A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of vertices. The characterisation is then applied to solve several problems in the area of edge-transitive graphs: answering a question proposed by Xu (1998) regarding normal Cayley graphs; providing a method for constructing edge-transitive graphs of valency 4 with arbitrarily large vertex-stabiliser; const...

In this paper, we give a characterisation for class of edge-transitive Cayley graphs and provide method constructing valency 4 with arbitrarily large vertex stabiliser. particular, in the last section, obtain certain extensions results Li et al. (Tetravalent odd number vertices, J Comb Theory Ser B 96:164–181, 2006) on half-transitive graphs.