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
关键词
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 条
  • [1] Triangle-free distance-regular graphs
    Yeh-jong Pan
    Min-hsin Lu
    Chih-wen Weng
    Journal of Algebraic Combinatorics, 2008, 27 : 23 - 34
  • [2] Triangle-free distance-regular graphs
    Pan, Yeh-jong
    Lu, Min-hsin
    Weng, Chih-wen
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2008, 27 (01) : 23 - 34
  • [3] Extremal 1-codes in distance-regular graphs of diameter 3
    Aleksandar Jurišić
    Janoš Vidali
    Designs, Codes and Cryptography, 2012, 65 : 29 - 47
  • [4] Distance-regular graphs of diameter 3 having eigenvalue-1
    Bang, Sejeong
    Koolen, Jack
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 531 : 38 - 53
  • [5] Extremal 1-codes in distance-regular graphs of diameter 3
    Jurisic, Aleksandar
    Vidali, Janos
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 65 (1-2) : 29 - 47
  • [6] Distance-Regular Graphs of Diameter 3 Without Triangles with c2=2
    Makhnev, A. A.
    Guo, Wenbin
    Efimov, K. S.
    COMMUNICATIONS IN MATHEMATICS AND STATISTICS, 2022, 10 (04) : 785 - 792
  • [7] Distance-regular graphs in which neighborhoods of vertices are isomorphic to the Gewirtz graph
    Gavrilyuk, A. L.
    Makhnev, A. A.
    Paduchikh, D. V.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2010, 16 (02): : 35 - 47
  • [8] On distance-regular graph Gamma with strongly regular graphs Gamma(2) and Gamma(3)
    Nirova, Marina Sefovna
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2018, 15 : 175 - 185
  • [9] Distance-regular graphs of large diameter that are completely regular clique graphs
    Hiroshi Suzuki
    Journal of Algebraic Combinatorics, 2018, 48 : 369 - 404
  • [10] Taut distance-regular graphs of even diameter
    MacLean, MS
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 91 (01) : 127 - 142