Finite Transitive Permutation Groups and Bipartite Vertex-Transitive Graphs

By Cheryl E. Praeger. 2003

91 citations recorded by the source corpus.

Subfields: Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/e8c0f0c543bb543d8f40e967747b4c4fdd379f77

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Caiheng Li
2. István Kovács

Citations in the corpus

• The finite vertex-primitive and vertex-biprimitive -transitive graphs for ≥4 (2001, background): “This suggests that the study of s-transitive graphs should be divided into two steps: studying basic s-transitive graphs and studying their normal covers (see [ 26 ]).”