Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
From MaRDI portal
Publication:1620780
DOI10.1007/s10469-018-9486-5zbMath1434.05159OpenAlexW2883893916MaRDI QIDQ1620780
Aleksandr Alekseevich Makhnev, Dmitriĭ Viktorovich Paduchikh, Ludmila Yur'evna Tsiovkina
Publication date: 14 November 2018
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-018-9486-5
Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (3)
Covers of complete graphs and related association schemes ⋮ ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS ⋮ On a class of vertex-transitive distance-regular covers of complete graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On almost distance-transitive graphs
- Geodesic graphs with homogeneity conditions
- Covers of graphs and EGQs
- Minimal permutation representation of Thompson's simple group
- Antipodal distance transitive covers of complete graphs
- Minimal permutation representations of finite simple classical groups. Special linear, symplectic, and unitary groups
- Minimal permutation representations of finite simple orthogonal groups
- 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)\)
- Edge-symmetric distance-regular coverings of cliques: the affine case
- On affine distance-regular covers of complete graphs
This page was built for publication: Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
