Characterization of the Folded Johnson Graphs of Small Diameter by their Intersection Arrays

✍ Scribed by Klaus Metsch

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 221 KB
• Volume: 18
• Category: Article
• ISSN: 0195-6698
• DOI: 10.1006/eujc.1997.0143

✦ Synopsis

It is known that the folded Johnson graphs J (2m, m) with m ≥ 16 are uniquely determined as distance regular graphs by their intersection array. We show that the same holds for m ≥ 6.