On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph (Q6051963)

From MaRDI portal
scientific article; zbMATH DE number 7740750
Language Label Description Also known as
English
On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph
scientific article; zbMATH DE number 7740750

    Statements

    On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph (English)
    0 references
    20 September 2023
    0 references
    There are interesting examples of distance-regular graphs for which \(\Gamma_3\) is a triangle-free graph, such as some Johnson graph \(J(7,3)\) and some \(Q\)-polynomial distance-regular graphs. Among the admissible parameters of distance-regular graphs for which \(\Gamma_3\) is a triangle-free graph, the existence or non-existence of distance-regular graphs of \(\{78, 50, 9; 1, 15, 60\}\), \(\{174, 110, 18; 1, 30, 132\}\) was not known. In this paper, the authors show the non-existence of two distance regular graphs whose innter section arrays are \(\{78, 50, 9; 1, 15, 60\}\), \(\{174, 110, 18; 1, 30, 132\}\) respectively. The proof is based on a contradiction of the triple intersection numbers.
    0 references
    distance-regular graph
    0 references
    triangle-free graph
    0 references
    triple intersection numbers
    0 references

    Identifiers