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

On a Distance-Regular Graph of Even Height with ke = kf

โœ Scribed by Hiroshi Nakano

Publisher
Springer Japan
Year
2001
Tongue
English
Weight
117 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Multiplicities of the Primitive I
On the Multiplicities of the Primitive Idempotents of a Q-Polynomial Distance-regular Graph
โœ Arlene A Pascasio ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 154 KB

and Terwilliger recently introduced the notion of a tridiagonal pair. We apply their results to distance-regular graphs and obtain the following theorem. THEOREM. Let denote a distance-regular graph with diameter D โ‰ฅ 3. Suppose is Q-polynomial with respect to the ordering E 0 , E 1 , . . . , E D of

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 =

On a Conjecture of Bannai and Ito: There
On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7
โœ J.H. Koolen; V. Moulton ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 312 KB

Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai-Ito conject