An Application of a Construction Theory
โ
A. Hiraki
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 112 KB
## Let be a distance-regular graph with where r โฅ 2 and c r +1 > 1. We prove that r = 2 except for the case a 1 = a r +1 = 0 and c r +1 = 2 by showing the existence of strongly closed subgraphs.