Distance regular covers of complete graphs from Latin squares

DOI10.1007/S10623-004-4851-XMaRDI QIDQ1766103zbMATH OpenOpenAlexWikidataFDO

Authors D. de Caen, Dmitry G. Fon-Der-Flaass

Publication date 28 February 2005

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-004-4851-x

zbMATH Keywords

Latin squaredistance regular covers

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Publication:4892000
• scientific article; zbMATH DE number 166092
• Coverings of complete bipartite graphs and associated structures
• Distance regular covers of the complete graph
• A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 926602 (Why is no real title available?)
• A family of antipodal distance-regular graphs related to the classical Preparata codes

Cited in

(2)

• scientific article; zbMATH DE number 563236 (Why is no real title available?)
• Equiangular lines and covers of the complete graph

This page was built for publication: Distance regular covers of complete graphs from Latin squares

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