ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We prove the following result. LetΓ be a finite distance-regular graph. Letc i ,a i ,b i be the intersection numbers ofΓ. IfΓ is not an ordinaryn-gon, then the number of (c i ,a i ,b i ) such thatc i =b i is bounded by a certain function of the valencyk, say 10k2 k .
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01788534
Permalink