AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive action of a {2,p}-group, has a non-identity semiregular automorphism. As a consequence, it is proved that a quartic vertex-transitive graph has a non-identity semiregular automorphism, thus giving a partial affirmative answer to the conjecture that all vertex-transitive graphs have such an automorphism and, more generally, that all 2-closed transitive permutation groups contain such an element (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) 69–81; P.J. Cameron (Ed.), Problems from the Fifteenth British Combinatorial Conference, Discrete Math. 167/168 (1997) 605–615])
It is well known that the Petersen graph, the Coxeter graph, as well as the graphs obtained from the...
A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same...
AbstractA nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of ...
It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) ...
It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally...
AbstractA nonidentity element of a permutation group is said to be semiregular if all of its orbits ...
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...
AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) ...
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at le...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex se...
It is well known that the Petersen graph, the Coxeter graph, as well as the graphs obtained from the...
A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same...
AbstractA nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of ...
It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) ...
It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally...
AbstractA nonidentity element of a permutation group is said to be semiregular if all of its orbits ...
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...
AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) ...
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at le...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex se...
It is well known that the Petersen graph, the Coxeter graph, as well as the graphs obtained from the...
A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same...
AbstractA nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of ...