RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2019 Volume 16, Pages 1254–1259 (Mi semr1127)

This article is cited in 4 papers

Discrete mathematics and mathematical cybernetics

Distance-regular graphs with intersection array $\{69,56,10;1,14,60\}$, $\{74,54,15;1,9,60\}$ and $\{119,100,15;1,20,105\}$ do not exist

A. A. Makhnevab, M. M. Isakovac, M. S. Nirovac

a N.N. Krasovsky Institute of Mathematics and Meckhanics, 16, S. Kovalevskoy str., Ekaterinburg, 620990, Russia
b Ural Federal University named after the first President of Russia B.N.Yeltsin, 19, Mira str., Ekaterinburg, 620002, Russia
c Kabardino-Balkarian State University named after H.M. Berbekov, 175, Chernyshevsky str., Nalchik, 360004, Russia

Abstract: Distance regular graphs $\Gamma$ of diameter 3 for which the graphs $\Gamma_2$ and $\Gamma_3$ are strongly regular, studied by M.S. Nirova. For $Q$-polynomial graphs with intersection arrays $\{69,56,10; 1,14,60\}$ and $\{119,100,15; 1, 20,105\}$ the graph $\Gamma_3$ is strongly regular and does not contain triangles. Automorphisms of graphs with these intersection arrays were found by A.A. Makhnev, M.S. Nirova and M.M. Isakova, A.A. Makhnev, respectively. The graph $\Gamma$ with the intersection array $\{74,54,15; 1,9,60\} $ also is $Q $-polynomial, and $\Gamma_3$ is a strongly regular graph with parameters $(630,111,12,21)$. It is proved in the paper that graphs with intersection arrays $\{69,56,10;1,14,60\}$, $\{74,54,15; 1,9,60\}$ and $\{119,100,15; 1,20, 105\} $ do not exist.

Keywords: distance-regular graph, triple intersection numbers.

UDC: 519.17

MSC: 05C25

Received August 21, 2019, published September 18, 2019

DOI: 10.33048/semi.2019.16.087



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024