Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally s-arc transitive graphs. A graph is in the class if it is connected and if, for each vertex v, the subgroup of automorphisms fixing v acts transitively on the set of vertices at distance i from v, for each i from 1 to s. We prove that this class is closed under forming normal quotients. Several graphs in the class are designated as degenerate, and a nondegenerate graph in the class is called basic if all its nontrivial normal quotients are degenerate. We prove that, for s ≥ 2, a nondegenerate, nonbasic graph in the class is either a complete multipartite gr...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
AbstractLet Γ be a graph and G ≤ Aut(Γ). The group G is said to act distance-transitively on Γ if, f...
A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(u,v)$▫ and...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive gra...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
AbstractA finite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphism...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractBy Praeger, Saxl, and Yokoyama, the classification problem of finite primitive distance tran...
AbstractThis paper is a contribution to the programme to classify finite distance-transitive graphs ...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
AbstractLet Γ be a graph and G ≤ Aut(Γ). The group G is said to act distance-transitively on Γ if, f...
A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(u,v)$▫ and...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive gra...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
AbstractA finite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphism...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractBy Praeger, Saxl, and Yokoyama, the classification problem of finite primitive distance tran...
AbstractThis paper is a contribution to the programme to classify finite distance-transitive graphs ...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
AbstractLet Γ be a graph and G ≤ Aut(Γ). The group G is said to act distance-transitively on Γ if, f...
A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(u,v)$▫ and...