ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
From MaRDI portal
Publication:5068503
DOI10.15826/umj.2021.2.010zbMath1486.05321OpenAlexW4205773175MaRDI QIDQ5068503
Publication date: 6 April 2022
Published in: Ural Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/umj155
distance-regular graphedge-transitive grapharc-transitive graphgeodetic graphantipodal cover2-transitive group2-homogeneous group
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Group actions on combinatorial structures (05E18)
Related Items
Covers of complete graphs and related association schemes, On a class of vertex-transitive distance-regular covers of complete graphs. II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Search for properties of the missing Moore graph
- Geodesic graphs with homogeneity conditions
- Distance regular covers of the complete graph
- Antipodal distance transitive covers of complete graphs
- Minimal permutation representations of finite simple classical groups. Special linear, symplectic, and unitary groups
- Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
- Arc-transitive groups of automorphisms of antipodal distance-regular graphs of diameter 3 in affine case
- Two new infinite families of arc-transitive antipodal distance-regular graphs of diameter three with \(\lambda =\mu \) related to groups \(\mathrm{Sz}(q)\) and \(^2G_2(q)\)
- Arc-transitive antipodal distance-regular covers of complete graphs related to \(\mathrm{SU}_3(q)\)
- Arc-transitive antipodal distance-regular graphs of diameter three related to \(\mathrm{PSL}_d(q)\)
- \(k\)-homogeneous groups
- Antipodal covering graphs
- On affine distance-regular covers of complete graphs
- On Moore Graphs with Diameters 2 and 3
- MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
- Geodetic graphs of diameter two
