On distance-regular graphs with smallest eigenvalue at least -m
SCIE
SCOPUS
- Title
- On distance-regular graphs with smallest eigenvalue at least -m
- Authors
- Koolen, JH; Bang, S
- Date Issued
- 2010-11
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Abstract
- A non-complete geometric distance-regular graph is the point graph of a partial linear space in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for a fixed integer m >= 2, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least -m, diameter at least three and intersection number c(2) >= 2. (C) 2010 Elsevier Inc. All rights reserved.
- Keywords
- Geometric distance-regular graph; Smallest eigenvalue; Geometric strongly regular graph; Partial linear space; SYSTEMS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/25567
- DOI
- 10.1016/J.JCTB.2010.04.006
- ISSN
- 0095-8956
- Article Type
- Article
- Citation
- JOURNAL OF COMBINATORIAL THEORY SERIES B, vol. 100, no. 6, page. 573 - 584, 2010-11
- 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.