AbstractA graph, with a group G of its automorphisms, is said to be (G,s)-transitive if G is transitive on s-arcs but not on (s+1)-arcs of the graph. Let X be a connected (G,s)-transitive graph for some s≥1, and let Gv be the stabilizer of a vertex v∈V(X) in G. In this paper, we determine the structure of Gv when X has valency 5 and Gv is non-solvable. Together with the results of Zhou and Feng [J.-X. Zhou, Y.-Q. Feng, On symmetric graphs of valency five, Discrete Math. 310 (2010) 1725–1732], the structure of Gv is completely determined when X has valency 5. For valency 3 or 4, the structure of Gv is known
AbstractLet X be a vertex-transitive graph with complement X. We show that if both N, the neighbourh...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
summary:A graph $X$, with a group $G$ of automorphisms of $X$, is said to be $(G,s)$-transitive, for...
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...
A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on t...
AbstractA graph, with a group G of its automorphisms, is said to be (G,s)-transitive if G is transit...
Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p~k (k ≥ 1), and le...
Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-ar...
AbstractA graph Γ is called (G, s)-transitive if G is a subgroup of Aut(Γ) acting transitively on th...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
AbstractA subgroupG of automorphisms of a graphX is said to be 12- transitive if it is vertex- and e...
It is well known that the Petersen graph, the Coxeter graph, as well as the graphs obtained from the...
AbstractIn this paper we study finite, connected, 4-valent graphsXwhich admit an action of a groupGw...
AbstractLet X be a vertex-transitive graph with complement X. We show that if both N, the neighbourh...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...
summary:A graph $X$, with a group $G$ of automorphisms of $X$, is said to be $(G,s)$-transitive, for...
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...
A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on t...
AbstractA graph, with a group G of its automorphisms, is said to be (G,s)-transitive if G is transit...
Let X be a 4-valent connected vertex-transitive graph with odd-prime-power order p~k (k ≥ 1), and le...
Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-ar...
AbstractA graph Γ is called (G, s)-transitive if G is a subgroup of Aut(Γ) acting transitively on th...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
AbstractA subgroupG of automorphisms of a graphX is said to be 12- transitive if it is vertex- and e...
It is well known that the Petersen graph, the Coxeter graph, as well as the graphs obtained from the...
AbstractIn this paper we study finite, connected, 4-valent graphsXwhich admit an action of a groupGw...
AbstractLet X be a vertex-transitive graph with complement X. We show that if both N, the neighbourh...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
summary:A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In ...