𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new condition for distance-regular graphs

✍ Scribed by J.H. Koolen

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
109 KB
Volume
13
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new feasibility condition for distance
A new feasibility condition for distance-regular graphs
✍ Paul Terwilliger πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 228 KB

Let F be a distance-regular graph with valency k (k >I 2) and diameter at least 2, and denote by ;t 1 and 2%~m the second largest and least eigenvalue of F, respectively. Assume the multiplicity m( )O of some eigenvalue ;~ ( )~ :/: k) of F satisfies m( Z ) < k. Then ;~ = Z 1 or )'rot. and either (i)

A new inequality for distance-regular gr
A new inequality for distance-regular graphs
✍ Paul Terwilliger πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 521 KB

Given a nontrivial primitive idempotent E of a distance-regular graph/-with diameter d ~> 3, we obtain an inequality involving the intersection numbers of F for each integer i (3 ~< i ~< d). We show equality is attained for i = 3 if and only if equality is attained for all i (3 ~< i ~< d) if and onl

Three New Distance-regular Graphs
Three New Distance-regular Graphs
✍ Leonard H. Soicher πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 160 KB
Distance-regular Subgraphs in a Distance
Distance-regular Subgraphs in a Distance-regular Graph, III
✍ Akira Hiraki πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 254 KB

Let ⌫ be a distance-regular graph with l (1 , a 1 , b 1 ) ϭ 1 and c s ϩ 1 ϭ 1 for some positive integer s . We show the existence of a certain distance-regular graph of diameter s , containing given two vertices at distance s , as a subgraph in ⌫ .

Distance-regular Subgraphs in a Distance
Distance-regular Subgraphs in a Distance-regular Graph, IV
✍ Akira Hiraki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 280 KB

Let ⌫ be a distance-regular graph with a 1 ΟΎ 0 , r Ο­ max Ν• j 3 ( c j , a j , b j ) Ο­ ( c 1 , a 1 , b 1 ) Ν– Ρƒ 2 and a i Ο­ a 1 c i , for 1 Ρ€ i Ρ€ 2 r . Take any u and in ⌫ at distance r Ο© 1 . We show that there exists a collinearity graph of a generalized 2( r Ο© 1)-gon of order ( a 1 Ο© 1 , c r Ο© 1 Οͺ 1)