Distance-Regular Graphs with a Relatively Small Eigenvalue Multiplicity

Electronic Journal Of Combinatorics

Jack H. Koolen¹ 

关键词: Distance-regular graphs;    Taylor graphs;    Light tail;    Tight distance-regular graphs;    Small multiplicity;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Godsil showed that if $\Gamma$ is a distance-regular graph with diameter $D \geq 3$ and valency $k \geq 3$, and $\theta$ is an eigenvalue of $\Gamma$ with multiplicity $m \geq 2$, then $k \leq\frac{(m+2)(m-1)}{2}$.

【 授权许可】

Others