Linear groups and distance-transitive graphs
From MaRDI portal
Publication:1824628
DOI10.1016/S0195-6698(89)80013-7zbMath0683.05023MaRDI QIDQ1824628
Publication date: 1989
Published in: European Journal of Combinatorics (Search for Journal in Brave)
20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Related Items
The Multiplicity Free Permutation Representations of the Ree Groups2G2(q), the Suzuki Groups2B2(q), and Their Automorphism Groups, Distance-transitive representations of groups G with \(PSL_ 2(q)\trianglelefteq G\leq P\Gamma L_ 2(q)\), Finite primitive distance-transitive graphs, On distance transitive graphs whose automorphism groups are affine, Classifications of finite highly transitive dimensional linear spaces, Classifying vertex-transitive graphs whose order is a product of two primes, On bijections that preserve complementarity of subspaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The modular characters of the Mathieu groups
- On the maximal subgroups of the finite classical groups
- Two multiplicity-free permutation representations of the general linear group \(GL(n,q^ 2)\)
- Multiplicity-free permutation representations of finite linear groups
- Distance-regular graphs with girth 3 or 4: I
- Distance-transitive representations of the symmetric groups
- Distance-regular graphs and halved graphs
- On the minimal degrees of projective representations of the finite Chevalley groups
- On finite groups generated by odd transpositions. IV
- Finite groups generated by 3-transpositions. I
- A note on decomposition numbers for general linear groups and symmetric groups
- The Rank 3 Permutation Representations of the Finite Classical Groups
- On the Orders of Maximal Subgroups of the Finite Classical Groups
- Distance transitive graphs with symmetric or alternating automorphism group
- The Affine Permutation Groups of Rank Three
- Locally petersen graphs