|
This article is cited in 2 scientific papers (total in 2 papers)
On automorphisms of a distance-regular graph with intersection array $\{99,84,30;1,6,54\}$
K. S. Efimova, A. A. Makhnevb a Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
b Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Abstract:
Recently it was shown that a distance-regular graph in which neighbourhoods of vertices are strongly regular with parameters (99,14,1,2) has intersection array $\{99,84,1;1,14,99\}$, $\{99,84,1;1,12,99\}$ or $\{99,84,30;1,6,54\}$. In the present paper we find possible automorphisms of a graph with the intersection array $\{99,84,30;1,6,54\}$. It is shown, in particular, that such a graph is not point-symmetric.
Keywords:
distance-regular graph, strongly regular graph, automorphism of a graph.
Received: 26.01.2016
Citation:
K. S. Efimov, A. A. Makhnev, “On automorphisms of a distance-regular graph with intersection array $\{99,84,30;1,6,54\}$”, Diskr. Mat., 29:1 (2017), 10–16; Discrete Math. Appl., 28:1 (2018), 23–27
Linking options:
https://www.mathnet.ru/eng/dm1402https://doi.org/10.4213/dm1402 https://www.mathnet.ru/eng/dm/v29/i1/p10
|
|