RUS  ENG
Полная версия
ЖУРНАЛЫ // Ural Mathematical Journal // Архив

Ural Math. J., 2017, том 3, выпуск 1, страницы 27–32 (Mi umj29)

Эта публикация цитируется в 2 статьях

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

Аннотация: 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)$.

Ключевые слова: Strongly regular graph, Distance-regular graph.

Язык публикации: английский

DOI: 10.15826/umj.2017.1.001



Реферативные базы данных:


© МИАН, 2024