On a class of vertex-transitive distance-regular covers of complete graphs. II

DOI10.33048/SEMI.2022.19.030MaRDI QIDQ2676818zbMATH OpenFDO

Authors Ludmila Yur'evna Tsiovkina

Publication date 28 September 2022

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/SEMI.2022.19.030

zbMATH Keywords

abelian coverantipodal coverdistance-regular graphrank 3 groupvertextransitive graph

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Group actions on combinatorial structures (05E18)

Recommendations

• ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
• On a class of vertex-transitive distance-regular covers of complete graphs
• Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\)
• 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)\)

Cites work

• Antipodal distance transitive covers of complete graphs
• Distance regular covers of the complete graph
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 3758571 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1516803 (Why is no real title available?)
• scientific article; zbMATH DE number 3412859 (Why is no real title available?)
• On a class of edge-transitive distance-regular antipodal covers of complete graphs
• Strongly regular graphs
• The Finite Primitive Permutation Groups of Rank Three
• The primitive permutation groups of degree less than 2500.

Cited in

(5)

• On a class of vertex-transitive distance-regular covers of complete graphs
• ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
• Separating rank 3 graphs
• On G-vertex-transitive covers of complete graphs having at most two G-orbits on the arc set
• On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher

Describes a project that uses

Uses Software

• GAP
• GitHub

This page was built for publication: On a class of vertex-transitive distance-regular covers of complete graphs. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676818)