|
On a class of vertex-primitive arc-transitive amply regular graphs
M. P. Golubyatnikovab, N. V. Maslovaab a N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
b Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
Abstract:
A simple k-regular graph with v vertices is an amply regular graph with parameters (v,k,λ,μ) if any two adjacent vertices have exactly λ common neighbors and any two vertices which are at distance 2 in this graph have exactly μ common neighbors. Let G be a finite group, H⩽G, H={Hg|g∈G} be the corresponding conjugacy class of subgroups of G, and 1⩽d be an integer. We construct a simple graph Γ(G,H,d) as follows. The vertices of Γ(G,H,d) are the elements of H, and two vertices H1 and H2 from H are adjacent in Γ(G,H,d) if and only if |H1∩H2|=d. In this paper we prove that if q is a prime power with 13 \le q \equiv 1 \pmod{4}, G=SL_2(q), and H is a dihedral maximal subgroup of G of order 2(q-1), then the graph \Gamma(G, H, 8) is a vertex-primitive arc-transitive amply regular graph with parameters \left(\dfrac{q(q+1)}{2}, \dfrac{q-1}{2}, 1, 1\right) and with {\rm Aut}(PSL_2(q))\le {\rm Aut}(\Gamma). Moreover, we prove that \Gamma(G, H, 8) has a perfect 1-code, in particular, its diameter is more than 2.
Keywords:
finite simple group; arc-transitive graph; amply regular graph; edge-regular graph; graph of girth 3; Deza graph; perfect 1-code.
Received: 11.03.2022 Revised: 06.05.2022 Accepted: 11.05.2022
Citation:
M. P. Golubyatnikov, N. V. Maslova, “On a class of vertex-primitive arc-transitive amply regular graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 28, no. 2, 2022, 258–268
Linking options:
https://www.mathnet.ru/eng/timm1919 https://www.mathnet.ru/eng/timm/v28/i2/p258
|
Statistics & downloads: |
Abstract page: | 157 | Full-text PDF : | 41 | References: | 35 | First page: | 4 |
|