A structure theory for graphs with fixed smallest eigenvalue
SCIE
SCOPUS
- Title
- A structure theory for graphs with fixed smallest eigenvalue
- Authors
- Kim, HK; Koolen, JH; Yang, JY
- Date Issued
- 2016-09-01
- Publisher
- Elsevier Sciences
- Abstract
- In this paper, we will give a structure theory for graphs with fixed smallest eigenvalue. In order to do this, the concept of Hoffman graph (as introduced by Woo and Neumaier) is used. Our main result states that for fixed positive integer lambda and any graph G with smallest eigenvalue at least -lambda, there exist dense induced subgraphs Q(1),...,Q(c) in G such that each vertex lies in at most lambda Q(i)'s and almost all edges of G lie in at least one of the Q(i)'s. (C) 2016 Elsevier Inc. All rights reserved.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/37054
- DOI
- 10.1016/J.LAA.2016.03.044
- ISSN
- 0024-3795
- Article Type
- Article
- Citation
- Linear Algebra and its Applications, vol. 504, page. 1 - 13, 2016-09-01
- 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.