Edge-symmetric distance-regular coverings of cliques: the affine case

DOI10.1134/S0037446613060141zbMath1282.05065MaRDI QIDQ2436105

Ludmila Yur'evna Tsiovkina, Dmitriĭ Viktorovich Paduchikh, Aleksandr Alekseevich Makhnev

Publication date: 21 February 2014

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

distance-regular graphautomorphism groupedge-symmetric graph

Mathematics Subject Classification ID

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

Related Items (6)

Edge-symmetric distance-regular coverings of complete graphs: the almost simple case ⋮ Arc-transitive antipodal distance-regular covers of complete graphs related to \(\mathrm{SU}_3(q)\) ⋮ Covers of complete graphs and related association schemes ⋮ Arc-transitive groups of automorphisms of antipodal distance-regular graphs of diameter 3 in affine case ⋮ On automorphisms of a distance-regular graph with intersection array \(\{35,32,1;1,4,35\}\) ⋮ A note on Moore Cayley digraphs

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\)
• Geodesic graphs with homogeneity conditions
• Antipodal distance transitive covers of complete graphs
• Minimal permutation representations of finite simple classical groups. Special linear, symplectic, and unitary groups
• The Primitive Permutation Groups of Odd Degree
• Finite Permutation Groups and Finite Simple Groups

This page was built for publication: Edge-symmetric distance-regular coverings of cliques: the affine case