On distance-regular graphs with smallest eigenvalue at least -m
被引:24
|
作者:
Koolen, J. H.
论文数: 0引用数: 0
h-index: 0
机构:
POSTECH, Pohang Math Inst, Pohang 790784, South Korea
POSTECH, Dept Math, Pohang 790784, South KoreaPOSTECH, Pohang Math Inst, Pohang 790784, South Korea
Koolen, J. H.
[1
,2
]
Bang, S.
论文数: 0引用数: 0
h-index: 0
机构:
Pusan Natl Univ, Dept Math, Pusan 609735, South KoreaPOSTECH, Pohang Math Inst, Pohang 790784, South Korea
Bang, S.
[3
]
机构:
[1] POSTECH, Pohang Math Inst, Pohang 790784, South Korea
[2] POSTECH, Dept Math, Pohang 790784, South Korea
[3] Pusan Natl Univ, Dept Math, Pusan 609735, South Korea
A non-complete geometric distance-regular graph is the point graph of a partial linear space in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for a fixed integer m >= 2, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least -m, diameter at least three and intersection number c(2) >= 2. (C) 2010 Elsevier Inc. All rights reserved.
机构:
Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, EkaterinburgInstitute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Ekaterinburg