Given an infinite family of finite primitive groups, conditions are found which ensure that almost all the orbitals are not self-paired. If p is a prime number congruent to +/-1(mod 10), these conditions apply to the groups PSL(2, p) acting on the cosets of a subgroup isomorphic to A5. In this way, infinitely many vertex-primitive 1/2-transitive graphs which are not metacirculants are obtained.MathematicsStatistics & ProbabilitySCI(E)30ARTICLE113-1245
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A step forward is made in a long standing Lovász problem regarding hamiltonicity of vertex-transitiv...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
AbstractA graph is said to be half-transitive if its automorphism group acts transitively on the ver...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
A graph is vertex-primitive if its automorphism group does not preserve any nontrivial partition of ...
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not v...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primiti...
AbstractIn this paper, we study finite primitive permutation groups with a small suborbit. Based on ...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
If G is a group acting on a set Ω, and α, β ∈ Ω, the directed graph whose vertex set is Ω and whose ...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A step forward is made in a long standing Lovász problem regarding hamiltonicity of vertex-transitiv...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
AbstractA graph is said to be half-transitive if its automorphism group acts transitively on the ver...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
A graph is vertex-primitive if its automorphism group does not preserve any nontrivial partition of ...
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not v...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primiti...
AbstractIn this paper, we study finite primitive permutation groups with a small suborbit. Based on ...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
If G is a group acting on a set Ω, and α, β ∈ Ω, the directed graph whose vertex set is Ω and whose ...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A step forward is made in a long standing Lovász problem regarding hamiltonicity of vertex-transitiv...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...