An inequality involving the second largest and smallest eigenvalue of a distance-regular graph - Mathematics > CombinatoricsReportar como inadecuado




An inequality involving the second largest and smallest eigenvalue of a distance-regular graph - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.



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

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados