AbstractIt is shown that a 2-arc-transitive graph must be the incidence graph of a (known) symmetric design if (i) the stabilizer of some vertex acts faithfully on the set of neighbours of that vertex as a known doubly transitive group with no abelian normal subgroup and (ii) some pair of vertices at distance 2 is joined by more than six paths of length 2
AbstractA 2-arc in a graph Γ is a sequence (α, β, γ) of three vertices of Γ such that {α, β} and {β,...
AbstractThe classification of 2-arc-transitive Cayley graphs of cyclic groups, given in (J. Algebra....
For a graph Γ, a positive integer s and a subgroup G ≤ Aut(Γ), we prove that G is transitive on the ...
It is shown that a 2-arc-transitive graph must be the incidence graph of a (known) symmetric design ...
AbstractIt is shown that a 2-arc-transitive graph must be the incidence graph of a (known) symmetric...
AbstractThis paper forms part of a study of 2-arc transitivity for finite imprimitive symmetric grap...
AbstractA 2-arc in a graph X is a sequence of three distinct vertices of graph X where the first two...
AbstractIn this paper we give a classification of a family of symmetric graphs with complete 2-arc-t...
In this paper, three infinite families of locally 2-arc transitive graphs are constructed, which are...
A complete classification of 2-arc-transitive dihedrants, that is, Cayley graphs of dihedral groups ...
AbstractIn this paper, three infinite families of locally 2-arc transitive graphs are constructed, w...
A connected graph Σ of girth at least four is called a near n-gonal graph with respect to E, where n...
AbstractThis paper forms part of a study of 2-arc transitivity for finite imprimitive symmetric grap...
AbstractA 2-arc in a graph Γ is a sequence (α, β, γ) of three vertices of Γ such that {α, β} and {β,...
AbstractLet Γ be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex ...
AbstractA 2-arc in a graph Γ is a sequence (α, β, γ) of three vertices of Γ such that {α, β} and {β,...
AbstractThe classification of 2-arc-transitive Cayley graphs of cyclic groups, given in (J. Algebra....
For a graph Γ, a positive integer s and a subgroup G ≤ Aut(Γ), we prove that G is transitive on the ...
It is shown that a 2-arc-transitive graph must be the incidence graph of a (known) symmetric design ...
AbstractIt is shown that a 2-arc-transitive graph must be the incidence graph of a (known) symmetric...
AbstractThis paper forms part of a study of 2-arc transitivity for finite imprimitive symmetric grap...
AbstractA 2-arc in a graph X is a sequence of three distinct vertices of graph X where the first two...
AbstractIn this paper we give a classification of a family of symmetric graphs with complete 2-arc-t...
In this paper, three infinite families of locally 2-arc transitive graphs are constructed, which are...
A complete classification of 2-arc-transitive dihedrants, that is, Cayley graphs of dihedral groups ...
AbstractIn this paper, three infinite families of locally 2-arc transitive graphs are constructed, w...
A connected graph Σ of girth at least four is called a near n-gonal graph with respect to E, where n...
AbstractThis paper forms part of a study of 2-arc transitivity for finite imprimitive symmetric grap...
AbstractA 2-arc in a graph Γ is a sequence (α, β, γ) of three vertices of Γ such that {α, β} and {β,...
AbstractLet Γ be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex ...
AbstractA 2-arc in a graph Γ is a sequence (α, β, γ) of three vertices of Γ such that {α, β} and {β,...
AbstractThe classification of 2-arc-transitive Cayley graphs of cyclic groups, given in (J. Algebra....
For a graph Γ, a positive integer s and a subgroup G ≤ Aut(Γ), we prove that G is transitive on the ...
DOI
Add to ORKG