Skip to main content
SpringerLink
Log in

On automorphisms of a distance-regular graph with intersection array {39, 36, 1; 1, 2, 39}

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

Abstract

Possible prime-order automorphisms and their fixed-point subgraphs are found for a hypothetical distance-regular graph with intersection array {39, 36, 1; 1, 2, 39}. It is shownthat graphs with intersection arrays {15, 12, 1; 1, 2, 15}, {35, 32, 1; 1, 2, 35}, and {39, 36, 1; 1, 2, 39} are not vertex-symmetric.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. P. Burichenko and A. A. Makhnev, “On amply regular locally cyclic graphs,” in Modern Problems of Mathematics: Abstracts of the 42nd All-Russia Youth Conference, Yekaterinburg, Russia, 2011 (IMM UrO RAN, Yekaterinburg, 2011), pp. 181–183.

    Google Scholar 

  2. V. P. Burichenko and A. A. Makhnev, “On automorphisms of distance-regular graph with intersection array {15, 12, 1; 1, 2, 15},” Dokl. Math. 86 (1), 519–523 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  3. A. A. Makhnev and D. V. Paduchikh, “On automorphisms of a distance-regular graph with intersection array {24, 21, 3; 1, 3, 18},” Dokl. Math. 84 (3), 774–777 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  4. L. Yu. Tsiovkina, “On automorphisms of a graph with intersection array {35, 32, 1; 1, 2, 35},” Sib. Elektron. Mat. Izv. 9, 285–293 (2012).

    MathSciNet  MATH  Google Scholar 

  5. P. J. Cameron, Permutation Groups (Cambridge Univ. Press, Cambridge, 1999), Ser. London Math. Soc. Student Texts 45.

    Book  MATH  Google Scholar 

  6. 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).

    Article  MathSciNet  MATH  Google Scholar 

  7. C. D. Godsil, R. A. Liebler, and C. E. Praeger, “Antipodal distance transitive covers of complete graphs,” Europ. J. Comb. 19 (4), 455–478 (1998).

    Article  MathSciNet  MATH  Google Scholar 

  8. A. V. Zavarnitsine, “Finite simple groups with narrow prime spectrum,” Siberian Electron. Math. Rep. 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 

  10. The GAP Group (GAP—Groups, Algorithms, and Programming), Version 4.7.8. http://www.gap-system.org

Download references

Author information

Authors and Affiliations

  1. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Yekaterinburg, 620990, Russia

    I. N. Belousov

  2. Ural Federal University, Yekaterinburg, 620002, Russia

    I. N. Belousov

Authors
  1. I. N. Belousov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. N. Belousov.

Additional information

Original Russian Text © I.N. Belousov, 2015, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2015, Vol. 21, No. 3.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Belousov, I.N. On automorphisms of a distance-regular graph with intersection array {39, 36, 1; 1, 2, 39}. Proc. Steklov Inst. Math. 295 (Suppl 1), 28–37 (2016). https://doi.org/10.1134/S0081543816090042

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation