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 条

[31] Twice Q-polynomial distance-regular graphs of diameter 4
JianMin Ma
Jack H. Koolen
Science China Mathematics, 2015, 58 : 2683 - 2690
[32] A Triangle-free, 4-chromatic Q3 Euclidean distance graph Scavenger hunt!
Joe, Jonathan
Noble, Matt
DISCRETE APPLIED MATHEMATICS, 2023, 339 : 216 - 226
[33] On bipartite distance-regular graphs with a strongly closed subgraph of diameter three
Kong, Qian
Wang, Kaishun
DISCRETE MATHEMATICS, 2010, 310 (24) : 3523 - 3527
[34] Distance-regular locally pseudo-GQ(5, 3)-graphs
A. A. Makhnev
D. V. Paduchikh
M. M. Khamgokova
Doklady Mathematics, 2014, 90 : 607 - 610
[35] Triangle-free 2P3-free graphs are 4-colorable
Pyatkin, Artem V.
DISCRETE MATHEMATICS, 2013, 313 (05) : 715 - 720
[36] Distance-regular locally pseudo-GQ(5,3)-graphs
Makhnev, A. A.
Paduchikh, D. V.
Khamgokova, M. M.
DOKLADY MATHEMATICS, 2014, 90 (02) : 607 - 610
[37] Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
Hiroshi Suzuki
Journal of Algebraic Combinatorics, 2009, 30 : 401 - 413
[38] Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
Suzuki, Hiroshi
JOURNAL OF ALGEBRAIC COMBINATORICS, 2009, 30 (03) : 401 - 413
[39] Distance-regular graphs where the distance-d graph has fewer distinct eigenvalues
Brouwer, A. E.
Fiol, M. A.
LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 480 : 115 - 126
[40] 3-CHOOSABILITY OF TRIANGLE-FREE PLANAR GRAPHS WITH CONSTRAINTS ON 4-CYCLES
Dvorak, Zdenek
Lidicky, Bernard
Skrekovski, Riste
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (03) : 934 - 945

← 1 2 3 4 5 →