✦ LIBER ✦

On the Characterization of the Folded Johnson Graphs and the Folded Halved Cubes by their Intersection Arrays

✍ Scribed by Klaus Metsch

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of the Folded Johnson G

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

✍ Klaus Metsch 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 221 KB

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.