A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this
paper, the s-regular elementary abelian coverings of the complete bipartite graph K3, 3 and …

A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this
paper, we classify the s-regular elementary Abelian coverings of the three-dimensional …

A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In
this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for …

An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-
arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. For a …

In this paper, infinitely many graphs of large valency which are half-transitive (that is vertex-
and edge-transitive but not arc-transitive) are constructed, and a complete classification is …

On edge-transitive Cayley graphs of valency four - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

This paper aims to develop a theory for studying Cayley graphs, especially for those with a
high degree of symmetry. The theory consists of analysing several types of basic Cayley …

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 …

A graph is said to be half-arc-transitive if its automorphism group acts transitively on the set
of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of …

Abstract Following Alspach and Parsons, a metacirculant graph is a graph admitting a
transitive group generated by two automorphisms ρ and σ, where ρ is (m, n)-semiregular for …