Yet another distance regular graph related to a Golay code
type: Item
instance of: scholarly article
title: Yet another distance regular graph related to a Golay code
zbMATH Open document ID: 0810.05030
author: Leonard H. Soicher
published in: The Electronic Journal of Combinatorics
publication date: 1995-02-09T00:00:00Z
full work available at URL: https://eudml.org/doc/118556
full work available at URL: N1
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\).
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 721222
zbMATH Keywords: distance regular graph
zbMATH Keywords: Golay code
zbMATH Keywords: intersection array
zbMATH Keywords: automorphism group
describes a project that uses: nauty
MaRDI profile type: Publication
Recommended article: Classification of a class of distance-regular graphs via completely regular codes
Recommended article: Distance-regular graphs admitting a perfect 1-code
Recommended article: Codes in Shilla distance-regular graphs
Recommended article: An algebraic characterization of completely regular codes in distance-regular graphs
Recommended article: Completely regular codes with different parameters giving the same distance-regular coset graphs
Recommended article: A family of antipodal distance-regular graphs related to the classical Preparata codes
Recommended article: Q3829476
Recommended article: New families of completely regular codes and their corresponding distance regular coset graphs
Recommended article: Families of nested completely regular codes and distance-regular graphs
Recommended article: Graphs associated with codes of covering radius 1 and minimum distance 2
description: scientific article; zbMATH DE number 721222