Bounding the Intersection Number C2 of a Distance-Regular Graph with Classical Parameters (d,b,α,β) in Terms of B
Discrete Mathematics(2025)
摘要
Let Γ be a distance-regular graph with classical parameters (D,b,α,β) and b≥1. It is known that Γ is Q-polynomial with respect to θ1, where θ1=b1b−1 is the second largest eigenvalue of Γ. And it was shown that for a distance-regular graph Γ with classical parameters (D,b,α,β), D≥5 and b≥1, if a1 is large enough compared to b and Γ is thin, then the intersection number c2 of Γ is bounded above by a function of b. In this paper, we obtain a similar result without the assumption that the graph Γ is thin.
更多查看译文
关键词
Distance-regular graphs,Classical parameters,Eigenvalues,Cliques
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要