summary:A graph $X$, with a group $G$ of automorphisms of $X$, is said to be $(G,s)$-transitive, for some $s\geq 1$, if $G$ is transitive on $s$-arcs but not on $(s+1)$-arcs. Let $X$ be a connected $(G,s)$-transitive graph of prime valency $p\geq 5$, and $G_v$ the vertex stabilizer of a vertex $v\in V(X)$. Suppose that $G_v$ is solvable. Weiss (1974) proved that $|G_v|\mid p(p-1)^2$. In this paper, we prove that $G_v\cong (\mathbb Z_p\rtimes \mathbb Z_m)\times \mathbb Z_n$ for some positive integers $m$ and $n$ such that $n\div m$ and $m\mid p-1$
AbstractWe discuss a possible approach to the study of finite arc-transitive digraphs and prove an u...
AbstractLet φ be Euler's phi function. Let n be a square-free positive integer such that gcd(n,φ(n))...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
summary:A graph $X$, with a group $G$ of automorphisms of $X$, is said to be $(G,s)$-transitive, for...
AbstractA graph, with a group G of its automorphisms, is said to be (G,s)-transitive if G is transit...
AbstractA graph X, with a subgroup G of the automorphism group Aut(X) of X, is said to be (G,s)-tran...
summary:Let $X$ be a finite simple undirected graph with a subgroup $G$ of the full automorphism gro...
Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p~k (k ≥ 1), and le...
A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M ...
AbstractIn this paper we discuss a method for bounding the size of the stabiliser of a vertex in a G...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
It is well known that the Petersen graph, the Coxeter graph, as well as the graphs obtained from the...
It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive...
AbstractThe results of Širáň and the first author [A construction of vertex-transitive non-Cayley gr...
AbstractWe discuss a possible approach to the study of finite arc-transitive digraphs and prove an u...
AbstractLet φ be Euler's phi function. Let n be a square-free positive integer such that gcd(n,φ(n))...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
summary:A graph $X$, with a group $G$ of automorphisms of $X$, is said to be $(G,s)$-transitive, for...
AbstractA graph, with a group G of its automorphisms, is said to be (G,s)-transitive if G is transit...
AbstractA graph X, with a subgroup G of the automorphism group Aut(X) of X, is said to be (G,s)-tran...
summary:Let $X$ be a finite simple undirected graph with a subgroup $G$ of the full automorphism gro...
Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p~k (k ≥ 1), and le...
A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M ...
AbstractIn this paper we discuss a method for bounding the size of the stabiliser of a vertex in a G...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
It is well known that the Petersen graph, the Coxeter graph, as well as the graphs obtained from the...
It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive...
AbstractThe results of Širáň and the first author [A construction of vertex-transitive non-Cayley gr...
AbstractWe discuss a possible approach to the study of finite arc-transitive digraphs and prove an u...
AbstractLet φ be Euler's phi function. Let n be a square-free positive integer such that gcd(n,φ(n))...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...