Home On small distance-regular graphs with the intersection arrays {mn − 1, (m − 1)(n + 1), n − m + 1; 1, 1, (m − 1)(n + 1)}
Article
Licensed
Unlicensed Requires Authentication

On small distance-regular graphs with the intersection arrays {mn − 1, (m − 1)(n + 1), nm + 1; 1, 1, (m − 1)(n + 1)}

  • Aleksandr A. Makhnev EMAIL logo and Mikhail P. Golubyatnikov
Published/Copyright: October 16, 2023

Abstract

Let Γ be a diameter 3 distance-regular graph with a strongly regular graph Γ3, where Γ3 is the graph whose vertex set coincides with the vertex set of the graph Γ and two vertices are adjacent whenever they are at distance 3 in the graph Γ. Computing the parameters of Γ3 by the intersection array of the graph Γ is considered as the direct problem. Recovering the intersection array of the graph Γ by the parameters of Γ3 is referred to as the inverse problem. The inverse problem for Γ3 has been solved earlier by A. A. Makhnev and M. S. Nirova. In the case where Γ3 is a pseudo-geometric graph of a net, a series of admissible intersection arrays has been obtained: {c2(u2m2) + 2c2mc2 − 1, c2(u2m2), (c2 − 1)(u2m2) + 2c2mc2; 1, c2, u2m2} (A. A. Makhnev, Wenbin Guo, M. P. Golubyatnikov). The cases c2 = 1 and c2 = 2 have been examined by A. A. Makhnev, M. P. Golubyatnikov and A. A. Makhnev, M. S. Nirova, respectively.

In this paper in the class of graphs with the intersection arrays {mn − 1, (m − 1)(n + 1)}, {nm + 1}; 1, 1, (m − 1)(n + 1)} all admissible intersection arrays for {3 ≤ m ≤ 13} are found: {20,16,5; 1, 1,16}, {39,36,4; 1, 1,36}, {55,54,2; 1, 2,54}, {90,84,7; 1, 1,84}, {220,216,5; 1, 1,216}, {272,264,9; 1, 1,264} and {350,336,15; 1, 1,336}. It is demonstrated that graphs with the intersection arrays {20,16,5; 1, 1,16}, {39,36,4; 1, 1,36} and {90,84,7; 1, 1,84} do not exist.


Note: Originally published in Diskretnaya Matematika (2022) 34,№ 1, 76–87 (in Russian).


  1. Funding: The research was supported by the Russian Science Foundation (project № 19-71-10067).

References

[1] A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin Heidelberg New York, 1989.Search in Google Scholar

[2] Makhnev, A. A.; Nirova, M. S., “Distance-regular Shilla graphs with b2 = c2”, Mat. Zametki, 103:5 (2018), 780-792.Search in Google Scholar

[3] Makhnev A., Golubyatnikov M., Guo Wenbin, “Inverse problems in graph theory: nets”, Comm. Math. Stat., 7:1 (2019), 69–83.Search in Google Scholar

[4] Makhnev A. A., Golubyatnikov M. P., “Automorphisms of a graph with intersection array {nm − −1, nmn + m1, nm + 1; 1, 1, nmn + m − 1}.”, Algebra Logika, 59:5 (2020), 385-394.Search in Google Scholar

[5] Makhnev A. A., Nirova M. S., “On distance-regular graphs with c2 = 2”, Discrete Math. Appl., 31:6 (2021), 397–401.Search in Google Scholar

[6] Makhnev A. A., “Automorphisms of distance-regular graph with intersection array {24, 18, 9; 1, 1, 16}”, Sib. Élektron. Mat. Izv., 16 (2019), 1547–1552 (in Russian).Search in Google Scholar

[7] Golubyatnikov M. P., “Automorphisms of small graphs with intersection array {nm − 1, nmn + m − 1, nm + 1; 1, 1, nmn + m − 1}”, Sib. Élektron. Mat. Izv., 16 (2019), 1245–1253 (in Russian).Search in Google Scholar

[8] K. Coolsaet, A. Jurishich, “Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs”, J. Comb. Theory, Ser. A, 115 (2008), 1086–1095.Search in Google Scholar

Received: 2021-08-15
Published Online: 2023-10-16
Published in Print: 2023-10-26

© 2023 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 15.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma-2023-0025/html
Scroll to top button