The nonexistence of distance-regular graphs with intersection arrays {27, 20, 10; 1, 2, 18} and {36, 28, 4; 1, 2, 24}

A.E. Brouwer, S. Sumalroj, C. Worawannotai

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)
62 Downloads (Pure)

Abstract

Locally, a distance-regular graph with ‘μ = 2’ carries the structure of a partial linear space. Using this, we show that there are no distanceregular graphs with intersection array {27, 20, 10; 1, 2, 18} or {36, 28, 4; 1, 2, 24} (on, respectively, 448 or 625 vertices).

Original languageEnglish
Pages (from-to)330-332
Number of pages3
JournalThe Australasian Journal of Combinatorics
Volume66
Issue number2
Publication statusPublished - 2016

Fingerprint

Dive into the research topics of 'The nonexistence of distance-regular graphs with intersection arrays {27, 20, 10; 1, 2, 18} and {36, 28, 4; 1, 2, 24}'. Together they form a unique fingerprint.

Cite this