Yet another distance regular graph related to a Golay code

MaRDI QIDQ1344396zbMATH OpenFDO

Authors Leonard H. Soicher

Publication date 9 February 1995

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/118556, http://www.emis.de/journals/EJC/Volume_2/volume2.html#N1

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

automorphism groupdistance regular graphGolay codeintersection array

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Association schemes, strongly regular graphs (05E30)

Review text

Summary: We describe a new distance-regular, but not distance-transitive, graph. This graph has intersection array \(\{110,81,12;1,18,90\}\), and automorphism group \(M_{22}\colon 2\).

Recommendations

• Classification of a class of distance-regular graphs via completely regular codes
• Distance-regular graphs admitting a perfect 1-code
• Codes in Shilla distance-regular graphs
• An algebraic characterization of completely regular codes in distance-regular graphs
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• A family of antipodal distance-regular graphs related to the classical Preparata codes
• scientific article; zbMATH DE number 4104861
• New families of completely regular codes and their corresponding distance regular coset graphs
• Families of nested completely regular codes and distance-regular graphs
• Graphs associated with codes of covering radius 1 and minimum distance 2

Cited in

(1)

• Distance-regular graphs admitting a perfect 1-code

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Yet another distance regular graph related to a Golay code

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