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

DOI10.33048/SEMI.2021.18.056zbMATH Open1468.05024OpenAlexW3200766987MaRDI QIDQ2047149FDOQ2047149

Authors: Ludmila Yur'evna Tsiovkina 

Publication date: 19 August 2021

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

Full work available at URL: https://doi.org/10.33048/semi.2021.18.056

Recommendations

• ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
• On a class of vertex-transitive distance-regular covers of complete graphs. II
• 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)\)

zbMATH Keywords

distance-regular graphvertex-transitive graphabelian coverrank 3 groupantipodal cover

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Spectra of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transitive Graphs With Fewer Than Twenty Vertices
• Distance regular covers of the complete graph
• Antipodal distance transitive covers of complete graphs
• On 4-valent symmetric graphs
• Title not available (Why is that?)
• Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\)
• The primitive permutation groups of degree less than 2500.
• A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
• Minimal permutation representation of Thompson's simple group
• Antipodal graphs of diameter three
• Edge-symmetric distance-regular coverings of complete graphs: the almost simple case

Cited In (6)

• \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
• Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
• On \(G\)-vertex-transitive covers of complete graphs having at most two \(G\)-orbits on the arc set
• Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\)
• On the minimum vertex covering transversal dominating sets in graphs and their classification
• ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS

Uses Software

• GAP
• GRAPE

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

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