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 条
  • [1] THE DISTANCE-REGULAR ANTIPODAL COVERS OF CLASSICAL DISTANCE-REGULAR GRAPHS
    VANBON, JTM
    BROUWER, AE
    COMBINATORICS /, 1988, 52 : 141 - 166
  • [2] Restrictions on classical distance-regular graphs
    Jurisic, Aleksandar
    Vidali, Janos
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2017, 46 (3-4) : 571 - 588
  • [3] Restrictions on classical distance-regular graphs
    Aleksandar Jurišić
    Janoš Vidali
    Journal of Algebraic Combinatorics, 2017, 46 : 571 - 588
  • [4] Scaling Limits for the Gibbs States on Distance-Regular Graphs with Classical Parameters
    Koohestani, Masoumeh
    Obata, Nobuaki
    Tanaka, Hajime
    SYMMETRY INTEGRABILITY AND GEOMETRY-METHODS AND APPLICATIONS, 2021, 17
  • [5] Distance-Regular Graphs with Classical Parameters that Support a Uniform Structure: Case q ≤ 1
    Fernandez, Blas
    Maleki, Roghayeh
    Miklavic, Stefko
    Monzillo, Giusy
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2023, 46 (06)
  • [6] Classical distance-regular graphs of negative type
    Weng, CW
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 76 (01) : 93 - 116
  • [7] The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
    Brouwer, Andries E.
    Cioaba, Sebastian M.
    Ihringer, Ferdinand
    McGinnis, Matt
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 133 : 88 - 121
  • [8] On antipodal distance-regular graphs with μ=1
    Nirova, M. S.
    DOKLADY MATHEMATICS, 2013, 87 (01) : 69 - 72
  • [9] On antipodal distance-regular graphs with μ = 1
    M. S. Nirova
    Doklady Mathematics, 2013, 87 : 69 - 72
  • [10] Distance-regular graphs
    van Dam, Edwin R.
    Koolen, Jack H.
    Tanaka, Hajime
    ELECTRONIC JOURNAL OF COMBINATORICS, 2016, : 1 - 156