A lower bound for the spectral radius of graphs with fixed diameter
SCIE
SCOPUS
- Title
- A lower bound for the spectral radius of graphs with fixed diameter
- Authors
- Cioaba, SM; van Dam, ER; Koolen, JH; Lee, JH
- Date Issued
- 2010-08
- Publisher
- ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
- Abstract
- We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and the diameter of the graph. For the specific case of graphs with diameter three we give a slightly better bound. We also construct families of graphs with small spectral radius, thus obtaining asymptotic results showing that the bound is of the right order. We also relate these results to the extremal degree/diameter problem. (C) 2009 Elsevier Ltd. All rights reserved.
- Keywords
- MOORE GRAPHS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/25570
- DOI
- 10.1016/J.EJC.2009.07.007
- ISSN
- 0195-6698
- Article Type
- Article
- Citation
- EUROPEAN JOURNAL OF COMBINATORICS, vol. 31, no. 6, page. 1560 - 1566, 2010-08
- 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.