arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1007.3339math.CO
收藏

On a Koolen -- Park inequality and Terwilliger graphs

Alexander Gavrilyuk

英文摘要:

J.H. Koolen and J. Park have proved a lower bound for intersection number $c_2$ of a distance-regular graph $Γ$. Moreover, they showed that the graph $Γ$ which attains the equality in this bound is a Terwilliger graph. We prove that $Γ$ is the icosahedron, the Doro graph or the Conway-Smith graph, if equality is attained and $c_2\ge 2$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑