|
On distance-regular graphs $\Gamma$ of diameter 3 for which $\Gamma_3$ is a triangle-free graph
A. A. Makhnevab, Venbin Guoac a School of Mathematical Sciences, University of Science and Technology of China
b N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
c Institute of Science and Technology of the Chinese Academy of Sciences
Abstract:
There exist well-known distance-regular graphs $\Gamma$ of diameter 3 for which $\Gamma_3$ is a triangle-free graph. An example is given by the Johnson graph $J(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 $\Gamma$ with the intersection arrays $\{78,50,9;1,15,60\}$ and $\{174,110,18;1,30,132\}$ for which $\Gamma_3$ is a triangle-free graph.
Keywords:
distance-regular graph, triangle-free graph, triple intersection numbers.
Received: 03.04.2021
Citation:
A. A. Makhnev, Venbin Guo, “On distance-regular graphs $\Gamma$ of diameter 3 for which $\Gamma_3$ is a triangle-free graph”, Diskr. Mat., 33:4 (2021), 61–67; Discrete Math. Appl., 33:4 (2023), 199–204
Linking options:
https://www.mathnet.ru/eng/dm1684https://doi.org/10.4213/dm1684 https://www.mathnet.ru/eng/dm/v33/i4/p61
|
|