Journal ArticleOPEN ACCESS

Yet Another Distance Regular Graph Related to a Golay Code

  • Soicher L
The Electronic Journal of Combinatorics (1995) 2(1)
DOI: 10.37236/1220
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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$.

Cite

CITATION STYLE

APA

Soicher, L. H. (1995). Yet Another Distance Regular Graph Related to a Golay Code. The Electronic Journal of Combinatorics, 2(1). https://doi.org/10.37236/1220

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free