A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameterd= 3i− 1 withbi= 1 andk> 2

✍ Scribed by E. W. Lambeck

• Publisher: Springer
• Year: 1991
• Tongue: English
• Weight: 250 KB
• Volume: 1
• Category: Article
• ISSN: 0925-1022
• DOI: 10.1007/bf00123766

✦ Synopsis

Let [' be a distance regular graph with intersection array {bo, bl, . •., bd_l; ct, ..., ed}. It is shown that in same cases (c i 1, ai-I, br I) = (ct, at, bt) and (c2~ t, a2~ 1, b2i l) = (ci, a~, bi) imply k <_ 2b i + 1. As a corollary all distance regular graphs of diameter d = 3i -1 with b I = 1 and k > 2 are determined.