The classification of distance regular graphs is one of the most important problem at all.
距离正则图的分类问题一直是距离正则图研究中的一个重要的问题。
By using the eigenvalue techniques and properties of intersection Numbers, it is obtained that the distance regular graphs with the following intersection arrays are nonexistence.
利用距离正则图的特征值方法和交叉数的性质，证明了具有下列交叉阵列的距离正则图是不存在的。
应用推荐