AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) 69–81]) that every vertex-transitive digraph has a semiregular automorphism, that is, a nonidentity automorphism having all orbits of equal length. Despite several partial results supporting its content, the conjecture remains open. In this paper, it is shown that the conjecture holds whenever the graph is arc-transitive of valency pq, where p and q are primes (p may equal q), and such that its automorphism group has a nonabelian minimal normal subgroup with at least three orbits on the vertex set
A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, bu...
A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same...
AbstractA graph is half-arc-transitive if its automorphism group acts transitively on vertices and e...
AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) ...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive...
AbstractAn old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive grap...
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at le...
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at le...
A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex se...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
AbstractA nonidentity element of a permutation group is said to be semiregular if all of its orbits ...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractThe action of a subgroup G of automorphisms of a graph X is said to be half-arc-transitive i...
A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, bu...
A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same...
AbstractA graph is half-arc-transitive if its automorphism group acts transitively on vertices and e...
AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) ...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive...
AbstractAn old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive grap...
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at le...
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at le...
A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex se...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
AbstractA nonidentity element of a permutation group is said to be semiregular if all of its orbits ...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractThe action of a subgroup G of automorphisms of a graph X is said to be half-arc-transitive i...
A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, bu...
A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same...
AbstractA graph is half-arc-transitive if its automorphism group acts transitively on vertices and e...