Skip to main content
Log in

Automorphisms of a Distance-Regular Graph with Intersection Array \(\{30,22,9;1,3,20\}\)

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

A distance-regular graph \(\Gamma\) of diameter \(3\) is called a Shilla graph if it has the second eigenvalue \(\theta_{1}=a_{3}\). In this case \(a=a_{3}\) divides \(k\) and we set \(b=b(\Gamma)=k/a\). Koolen and Park obtained the list of intersection arrays for Shilla graphs with \(b=3\). There exist graphs with intersection arrays \(\{12,10,5;1,1,8\}\) and \(\{12,10,3;1,3,8\}\). The nonexistence of graphs with intersection arrays \(\{12,10,2;1,2,8\}\), \(\{27,20,10;1,2,18\}\), \(\{42,30,12;1,6,28\}\), and \(\{105,72,24;1,12,70\}\) was proved earlier. In this paper, we study the automorphisms of a distance-regular graph \(\Gamma\) with intersection array \(\{30,22,9;1,3,20\}\), which is a Shilla graph with \(b=3\). Assume that \(a\) is a vertex of \(\Gamma\), \(G=\mathrm{Aut}(\Gamma)\) is a nonsolvable group, \(\bar{G}=G/S(G)\), and \(\bar{T}\) is the socle of \(\bar{G}\). Then \(\bar{T}\cong L_{2}(7)\), \(A_{7}\), \(A_{8}\), or \(U_{3}(5)\). If \(\Gamma\) is arc-transitive, then \(T\) is an extension of an irreducible \(F_{2}U_{3}(5)\)-module \(V\) by \(U_{3}(5)\) and the dimension of \(V\) over \(F_{3}\) is \(20\), \(28\), \(56\), \(104\), or \(288\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs (Springer, Berlin, 1989).

    Book  Google Scholar 

  2. J. H. Koolen and J. Park, “Shilla distance-regular graphs,” Europ. J. Comb. 31, 2064–2073 (2010). https://doi.org/10.1016/j.ejc.2010.05.012

    Article  MathSciNet  MATH  Google Scholar 

  3. A. E. Brouwer, S. Sumaloj, and C. Worawannotai, “The nonexistence of distance-regular graphs with intersection arrays \(\{27,20,10;1,2,18\}\) and \(\{36,28,4;1,2,24\}\),” Australasian J. Comb. 66 (2), 330–332 (2016).

    MathSciNet  MATH  Google Scholar 

  4. I. N. Belousov and A. A. Makhnev, “Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist,” Sib. Elektron. Mat. Izv. 15, 1506–1512 (2018). https://doi.org/10.33048/semi.2018.15.125

    Article  MathSciNet  MATH  Google Scholar 

  5. I. N. Belousov and A. A. Makhnev, “A distance-regular graph with intersection array \(\{105,72,24;1,12,70\}\) does not exist,” Sib. Elektron. Mat. Izv. 16, 206–216 (2019). https://doi.org/10.33048/semi.2019.16.012

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Cameron, Permutation Groups (Cambridge Univ. Press, Cambridge, 1999).

    Book  Google Scholar 

  7. A. L. Gavrilyuk and A. A. Makhnev, “On automorphisms of distance-regular graphs with intersection array \(\{56,45,1;1,9,56\}\),” Dokl. Math. 81 (3), 439–442 (2010). https://doi.org/10.1134/S1064562410030282

    Article  MathSciNet  MATH  Google Scholar 

  8. A. V. Zavarnitsine, “Finite simple groups with narrow prime spectrum,” Sib. Elektron. Mat. Izv. 6, 1–12 (2009).

    MathSciNet  MATH  Google Scholar 

  9. J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson, Atlas of Finite Groups (Clarendon, Oxford, 1985).

    MATH  Google Scholar 

Download references

Funding

This work was supported by by the Joint Competition of the Russian Foundation for Basic Research and the National Natural Science Foundation of China (project no. 20-51-53013_a).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to K. S. Efimov or A. A. Makhnev.

Ethics declarations

The authors declare that they have no conflicts of interest.

Additional information

Translated from Trudy Instituta Matematiki i Mekhaniki UrO RAN, Vol. 26, No. 3, pp. 23 - 31, 2020 https://doi.org/10.21538/0134-4889-2020-26-3-23-31.

Translated by E. Vasil’eva

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Efimov, K.S., Makhnev, A.A. Automorphisms of a Distance-Regular Graph with Intersection Array \(\{30,22,9;1,3,20\}\). Proc. Steklov Inst. Math. 315 (Suppl 1), S89–S96 (2021). https://doi.org/10.1134/S0081543821060080

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543821060080

Keywords

Navigation