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

Sib. Èlektron. Mat. Izv., 2018 Volume 15, Pages 54–59 (Mi semr898)

This article is cited 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.

UDC: 519.17

MSC: 05C25

Received December 1, 2017, published January 31, 2018

DOI: 10.17377/semi.2018.15.007



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025