ON Q-POLYNOMIAL DISTANCE-REGULAR GRAPHS Γ WITH STRONGLY REGULAR GRAPHS Γ2 AND Γ3

被引：4
|
作者：
Belousov, Ivan Nikolaevich [1 ]
Makhnev, Aleksandr Alekseevich [1 ]
Nirova, Marina Sefovna [2 ]
机构：
[1] Russian Acad Sci, NN Krasovskii Inst Math & Mech, Ural Branch, 16 S Kovalevskaya Str, Ekaterinburg 620990, Russia
[2] Kabardino Balkarian State Univ, 175 Chernyshevsky Str, Nalchik 360004, Russia
来源：
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA | 2019年 / 16卷
关键词：
distance-regular graph; Q-polynomial graph;
D O I：
10.33048/semi.2019.16.096
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let Gamma be a distance-regular graph of diameter 3 with strongly regular graphs Gamma(2) and Gamma(3). Then F has intersection array {t(c(2) + 1) + a(3), tc(2), a(3) + 1; 1, c(2), t(c(2) + 1)} (Nirova M.S.) If Gamma is Q-polynomial then either a(3) = 0, t = 1 and Gamma is Taylor graph or (c(2) + 1) = a(3)(a(3) + 1)/(t(2) - a(3) - 1). We found 4 infinite series feasible intersection arrays in this situation.
引用
收藏
页码：1385 / 1392
页数：8
相关论文
共 50 条
12345