The distance-regular graphs such that all of its second largest local eigenvalues are at most one
SCIE
SCOPUS
- Title
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- Authors
- Koolen, JH; Yu, H
- Date Issued
- 2011-11-15
- Publisher
- ELSEVIER SCIENCE INC
- Abstract
- In this paper, we classify distance-regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the first author, who classified the distance-regular graphs with smallest eigenvalue -1 - b(1)/2. (C) 2011 Elsevier Inc. All rights reserved.
- Keywords
- Distance-regular graph; Line graph; Local eigenvalue; Generalized line graph; ROOT SYSTEMS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/17209
- DOI
- 10.1016/J.LAA.2011.02.049
- ISSN
- 0024-3795
- Article Type
- Article
- Citation
- LINEAR ALGEBRA AND ITS APPLICATIONS, vol. 435, no. 10, page. 2507 - 2519, 2011-11-15
- 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.