On distance transitive graphs whose automorphism groups are affine

DOI10.1016/0095-8956(92)90041-UzbMath0770.05059OpenAlexW2084298085MaRDI QIDQ1204477

Kazuhiro Yokoyama

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90041-u

zbMATH Keywords

automorphism groupHamming graphdistancediameterdistance transitive graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Related Items (1)

\((s,r;\mu )\)-nets and alternating forms graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homogeneous designs and geometric lattices
• Multiplicity-free permutation representations of finite linear groups
• Transitive linear groups and linear groups which contain irreducible subgroups of prime order. II
• A geometric consequence of the classification of finite doubly transitive groups
• Distance-transitive representations of the symmetric groups
• Finite linear spaces with flag-transitive groups
• A characterization of the association schemes of bilinear forms
• Incidence structures whose planes are nets
• An explicit model for the complex representations of the finite general linear groups
• Regular graphs with high edge degree
• Linear groups and distance-transitive graphs
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• Distance transitive graphs with symmetric or alternating automorphism group
• Distance Transitive Graphs and Finite Simple Groups
• The Affine Permutation Groups of Rank Three

This page was built for publication: On distance transitive graphs whose automorphism groups are affine