An inequality involving the second largest and smallest eigenvalue of a distance-regular graph - Mathematics > CombinatoricsReport as inadecuate




An inequality involving the second largest and smallest eigenvalue of a distance-regular graph - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: For a distance-regular graph with second largest eigenvalue resp. smallesteigenvalue \mu1 resp. \muD we show that \mu1+1\muD+1<= -b1 holds, whereequality only holds when the diameter equals two. Using this inequality westudy distance-regular graphs with fixed second largest eigenvalue.



Author: Jack H. Koolen, Jongyook Park, Hyonju Yu

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents