|
This article is cited in 2 scientific papers (total in 2 papers)
Automorphisms of distance-regular graph with intersection array $\{25,16,1;1,8,25\}$
Konstantin S. Efimovab, Alexander A. Makhnevcb a Ural State University of Economics, Ekaterinburg, Russia
b Ural Federal University, Ekaterinburg, Russia
c N.N. Krasovskii Institute of Mathematics and Mechanics UB RAS, Ekaterinburg, Russia
Abstract:
Makhnev and Samoilenko have found parameters of
strongly regular graphs with no more than 1000 vertices, which may
be neighborhoods of vertices in antipodal distance-regular graph of
diameter 3 and with $\lambda=\mu$. They proposed the program of
investigation vertex-symmetric antipodal distance-regular graphs of
diameter 3 with $\lambda=\mu$, in which neighborhoods of vertices
are strongly regular. In this paper we consider neighborhoods of
vertices with parameters $(25,8,3,2)$.
Keywords:
Strongly regular graph, Distance-regular graph.
Citation:
Konstantin S. Efimov, Alexander A. Makhnev, “Automorphisms of distance-regular graph with intersection array $\{25,16,1;1,8,25\}$”, Ural Math. J., 3:1 (2017), 27–32
Linking options:
https://www.mathnet.ru/eng/umj29 https://www.mathnet.ru/eng/umj/v3/i1/p27
|
Statistics & downloads: |
Abstract page: | 1738 | Full-text PDF : | 81 | References: | 55 |
|