On distance-regular graphs G of diameter 3 for which G??????3 is a triangle-free graph

被引：0
|
作者：
Makhnev, Aleksandr A. [1 ,2 ]
Guo, Wenbin [1 ,3 ]
机构：
[1] Univ Sci & Technol China, Sch Math Sci, Hefei, Peoples R China
[2] Russian Acad Sci, NN Krasovskii Inst Math & Mech, Ural Branch, Moscow, Russia
[3] Chinese Acad Sci, Inst Sci & Technol, Beijing, Peoples R China
来源：
DISCRETE MATHEMATICS AND APPLICATIONS | 2023年 / 33卷 / 04期
关键词：
distance-regular graph; triangle-free graph; triple intersection numbers;
D O I：
10.1515/dma-2023-0018
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
There exist well-known distance-regular graphs G of diameter 3 for which G(3) is a triangle-free graph. An example is given by the Johnson graph 1(8, 3) with the intersection array {15, 8, 3; 1, 4, 9}. The paper is concerned with the problem of the existence of distance-regular graphs G with the intersection arrays {78, 50, 9; 1, 15, 60} and {174, 110, 18; 1, 30, 132} for which G(3) is a triangle-free graph.
引用
收藏
页码：199 / 204
页数：6
相关论文
共 50 条
12345