|
This article is cited in 1 scientific paper (total in 1 paper)
Discrete mathematics and mathematical cybernetics
Small vertex-symmetric Higman graphs with $\mu=6$
N. D. Zyulyarkinaa, A. A. Makhnevbc a South Ural State University,
pr. Lenina, 76,
454080, Chelyabinsk, Russia
b N.N. Krasovsky Institute of Mathematics and Meckhanics,
str. S. Kovalevskoy, 16,
620990, Ekaterinburg, Russia
c Ural Federal University,
Mira street, 19,
620990, Ekaterinburg, Russia
Abstract:
Strongly regular graph with $v={m\choose 2}$ and $k=2(m-2)$ is called Higman graph.
In Higman graphs the parameter $\mu$ takes values $4, 6, 7$ and $8$. Previously the authors found
edge-symmetric Higman graphs.
It is realized the programm classification of vertex-symmetric Higman graphs. In this work we study the
vertex-symmetric Higman graphs with $\mu=6$ and $m=9,17$.
Keywords:
graph, automorphism, fixed-point subgraph.
Received December 1, 2017, published January 31, 2018
Citation:
N. D. Zyulyarkina, A. A. Makhnev, “Small vertex-symmetric Higman graphs with $\mu=6$”, Sib. Èlektron. Mat. Izv., 15 (2018), 54–59
Linking options:
https://www.mathnet.ru/eng/semr898 https://www.mathnet.ru/eng/semr/v15/p54
|
|