There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
SCIE
SCOPUS
- Title
- There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
- Authors
- Bang, S; Koolen, JH; Moulton, V
- Date Issued
- 2009-10
- Publisher
- WALTER DE GRUYTER & CO
- Abstract
- In their 1984 book "Algebraic Combinatorics I: Association Schemes'', Bannai and Ito conjectured that there are only finitely many distance-regular graphs with fixed valency at least three. In a series of papers they showed that their conjecture holds for the class of bipartite distance-regular graphs. In this paper we prove that the Bannai-Ito conjecture also holds for the more general class of regular near polygons, and for the class of geodetic distance-regular graphs.
- Keywords
- MOORE GRAPHS; CONJECTURE; BANNAI; ITO
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/27571
- DOI
- 10.1515/CRELLE.2009.
- ISSN
- 0075-4102
- Article Type
- Article
- Citation
- JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, vol. 635, page. 213 - 235, 2009-10
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.