๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Determination of the distance-regular graphs without 3-claws

โœ Scribed by A Blokhuis; A.E Brouwer

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
97 KB
Volume
163
Category
Article
ISSN
0012-365X

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 =