Open Access System for Information Sharing

Login Library

 

Article
Cited 24 time in webofscience Cited 23 time in scopus
Metadata Downloads

An inequality involving the second largest and smallest eigenvalue of a distance-regular graph SCIE SCOPUS

Title
An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
Authors
Koolen, JHPark, JYu, H
Date Issued
2011-06-15
Publisher
ELSEVIER SCIENCE INC
Abstract
For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) theta(1) (resp., theta(D)) we show that (theta(1) + 1)(theta(D) + 1) <= -b(1) holds, where equality only holds when the diameter equals two. Using this inequality we study distance-regular graphs with fixed second largest eigenvalue. (C) 2011 Elsevier Inc. All rights reserved.
Keywords
Distance-regular graph; Tight distance-regular graph; Bounds on eigenvalues; Shill distance-regular graphs
URI
https://oasis.postech.ac.kr/handle/2014.oak/17458
DOI
10.1016/J.LAA.2010.12.032
ISSN
0024-3795
Article Type
Article
Citation
LINEAR ALGEBRA AND ITS APPLICATIONS, vol. 434, no. 12, page. 2404 - 2412, 2011-06-15
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Views & Downloads

Browse