𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal 1-codes in distance-regular graphs of diameter 3

✍ Scribed by Aleksandar Jurišić, Janoš Vidali

Book ID
113064430
Publisher
Springer
Year
2012
Tongue
English
Weight
613 KB
Volume
65
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance regular graphs of diameter 3 an
Distance regular graphs of diameter 3 and strongly regular graphs
✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

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 =