A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices

DOI10.26493/1855-3974.191.16bzbMath1245.05136OpenAlexW1927756328WikidataQ129353403 ScholiaQ129353403MaRDI QIDQ3225724

Christian Pech, Mikhail H. Klin

Publication date: 22 March 2012

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.191.16b

zbMATH Keywords

automorphism groupsemibiplaneconference matrixTaylor graphgeneralized Hadamard matrixtwo-graphantipodal graphdistance regular coverFoster graphGodsil-Hensel matrixresolvable transversal design

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Association schemes, strongly regular graphs (05E30) Infinite graphs (05C63) Group actions on combinatorial structures (05E18)

Related Items (13)

ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS ⋮ Arc-transitive antipodal distance-regular covers of complete graphs related to \(\mathrm{SU}_3(q)\) ⋮ Tremain equiangular tight frames ⋮ Arc-transitive groups of automorphisms of antipodal distance-regular graphs of diameter 3 in affine case ⋮ Equiangular lines and covers of the complete graph ⋮ On the order of antipodal covers ⋮ Doubly transitive lines. I: Higman pairs and roux ⋮ The spectra of lifted digraphs ⋮ On a class of vertex-transitive distance-regular covers of complete graphs ⋮ Distance-regular graphs without 4-claws ⋮ Fundamentals of fractional revival in graphs ⋮ Polyphase equiangular tight frames and abelian generalized quadrangles ⋮ 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)\)

Uses Software

• GAP
• nauty
• GRAPE

This page was built for publication: A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices