We apply a result of Praeger, Saxl and Yokoyama [4] concerning the automorphism groups of primitive distance-transitive graphs to primitive distance-bitransitive graphs. Imprimitive distance-bitransitive graphs are discussed in Section 2. One of the cases of the Praeger, Saxl and Yokayama Theorem is considered in Section 3 and the following main result is proved in Section 4
AbstractIn this paper, we consider the automorphism groups of Cayley graphs which are a basis of a c...
AbstractWe give certain properties which are satisfied by the descendant set of a vertex in an infin...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
AbstractBy Praeger, Saxl, and Yokoyama, the classification problem of finite primitive distance tran...
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...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractBy Praeger, Saxl, and Yokoyama, the classification problem of finite primitive distance tran...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
AbstractThe status of the project of classifying finite primitive distance-transitive graphs is surv...
A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(u,v)$▫ and...
A detailed treatment is given of the graphs on which a group with simple socle PSL(n, q) acts primit...
AbstractThe status of the project of classifying finite primitive distance-transitive graphs is surv...
In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive gra...
AbstractIn this paper, we consider the automorphism groups of Cayley graphs which are a basis of a c...
AbstractWe give certain properties which are satisfied by the descendant set of a vertex in an infin...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
AbstractBy Praeger, Saxl, and Yokoyama, the classification problem of finite primitive distance tran...
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...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractBy Praeger, Saxl, and Yokoyama, the classification problem of finite primitive distance tran...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
AbstractThe status of the project of classifying finite primitive distance-transitive graphs is surv...
A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(u,v)$▫ and...
A detailed treatment is given of the graphs on which a group with simple socle PSL(n, q) acts primit...
AbstractThe status of the project of classifying finite primitive distance-transitive graphs is surv...
In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive gra...
AbstractIn this paper, we consider the automorphism groups of Cayley graphs which are a basis of a c...
AbstractWe give certain properties which are satisfied by the descendant set of a vertex in an infin...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
DOI
Add to ORKG