Further study of distance-regular graphs with classical parameters with b <-1

被引:1
|
作者
Tian, Yi [1 ,2 ]
Lin, Cong [1 ]
Hou, Bo [1 ,4 ]
Hou, Lihang [3 ]
Gao, Suogang [1 ,4 ]
机构
[1] Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Peoples R China
[2] Hebei Finance Univ, Sch Big Data Sci, Baoding 071051, Peoples R China
[3] Hebei GEO Univ, Sch Math & Sci, Shijiazhuang 050031, Peoples R China
[4] Hebei Int Joint Res Ctr Math & Interdisciplinary S, Shijiazhuang 050024, Peoples R China
关键词
Distance-regular graph; Classical parameters; Maximal regular near hexagon; CLOSED SUBGRAPHS;
D O I
10.1016/j.disc.2023.113817
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let Gamma be a distance-regular graph of diameter d with classical parameters (d, b, alpha, /3) with b < -1. Van Dam, Koolen and Tanaka [Distance-regular graphs, Electron. J. Combin. (2016) DS22] surveyed the classification of Gamma. From this survey, the following four cases have not been studied: (1) d >= 3, c2 = a1 =1; (2) d >= 3, c2 =1, a2 = a1 > 1; (3) d = 3, c2 =1, a2 > a1 > 1; (4) d = 3, c2 > 1, a1 >= 1. Here ai, bi, ci (0 <= i <= d) are the intersection numbers of Gamma. In this paper, we study the above four cases. Our main results are as follows. For the case (1), Gamma is the triality graph D 3 4,2(2); for the case (2), Gamma is the collinearity graph of a generalized hexagon of order (a1 + 1, (a1 + 1)3). In particular, if a1 + 1 is a prime power, then the classical parameters of Gamma are realized by the triality graphs D 3 4,2(a1 + 1); for the case (3), Gamma does not exist; for the case (4), precisely one of the following (i)-(iv) holds: (i) Gamma is the dual polar graph A 2 5(a1 + 1), where a1 + 1 is a prime power; (ii) Gamma is the extended ternary Golay code graph; (iii) Gamma is the large Witt graph M24; (iv) Gamma is the collinearity graph of a maximal regular near hexagon with classical parameters (c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:7
相关论文
共 50 条
  • [41] On distance-regular graphs with theta(2) = -1.
    Nirova, Marina Sefovna
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2018, 24 (02): : 215 - 228
  • [42] Pseudo 1-homogeneous distance-regular graphs
    Jurisic, Aleksandar
    Terwilliger, Paul
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2008, 28 (04) : 509 - 529
  • [43] On the primitive idempotents of distance-regular graphs
    Tomiyama, M
    DISCRETE MATHEMATICS, 2001, 240 (1-3) : 281 - 294
  • [44] On the Cheeger constant for distance-regular graphs
    Qiao, Zhi
    Koolen, Jack H.
    Markowsky, Greg
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2020, 173
  • [45] Distance-Regular Graphs of Valency 6 and a1 = 1
    Akira Hiraki
    Kazumasa Nomura
    Hiroshi Suzuki
    Journal of Algebraic Combinatorics, 2000, 11 : 101 - 134
  • [46] Tails of bipartite distance-regular graphs
    Lang, MS
    EUROPEAN JOURNAL OF COMBINATORICS, 2002, 23 (08) : 1015 - 1023
  • [47] CODES IN BIPARTITE DISTANCE-REGULAR GRAPHS
    BANNAI, E
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1977, 16 (OCT): : 197 - 202
  • [48] On electric resistances for distance-regular graphs
    Koolen, Jack H.
    Markowsky, Greg
    Park, Jongyook
    EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (04) : 770 - 786
  • [49] SOME INEQUALITIES IN DISTANCE-REGULAR GRAPHS
    NOMURA, K
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 58 (02) : 243 - 247
  • [50] A valency bound for distance-regular graphs
    Qiao, Zhi
    Koolen, Jack
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2018, 155 : 304 - 320