𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A constant bound on the number of columns (1,k− 2, 1) in the intersection array of a distance-regular graph

✍ Scribed by Akira Hiraki

Book ID
105329607
Publisher
Springer Japan
Year
1996
Tongue
English
Weight
664 KB
Volume
12
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A remark on the intersection arrays of d
A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameterd= 3i− 1 withbi= 1 andk> 2
✍ E. W. Lambeck 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 250 KB

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 =