Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2016, Volume 13, Pages 130–136
DOI: https://doi.org/10.17377/semi.2016.13.011
(Mi semr661)
 

This article is cited in 1 scientific paper (total in 1 paper)

Mathematical logic, algebra and number theory

Automorphisms of a distance-regular graph with intersection array $\{45,42,1;1,6,45\}$

A. A. Makhneva, V. I. Belousovab

a Institute of Mathematics and Mechanics UB RAS, S. Kovalevskoi 16, 620990, Yekaterinburg, Russia
b Ural Federal University, Mira 16, 620000, Yekaterinburg, Russia
Full-text PDF (155 kB) Citations (1)
References:
Abstract: Prime divisors of orders of automorphisms and the fixed point subgraphs of automorphisms of prime orders are studied for a hypothetical distance-regular graph with intersection array $\{45,42,1;1,6,45\}$. It is proved that this graph does not vertex-symmetric.
Keywords: distance-regular graph, automorphism group, antipodal cover.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 02.A03.21.0006
Russian Foundation for Basic Research 14-01-31298_мол_а
Received January 13, 2016, published March 4, 2016
Bibliographic databases:
Document Type: Article
UDC: 519.17
MSC: 05C25
Language: Russian
Citation: A. A. Makhnev, V. I. Belousova, “Automorphisms of a distance-regular graph with intersection array $\{45,42,1;1,6,45\}$”, Sib. Èlektron. Mat. Izv., 13 (2016), 130–136
Citation in format AMSBIB
\Bibitem{MakBel16}
\by A.~A.~Makhnev, V.~I.~Belousova
\paper Automorphisms of a distance-regular graph with intersection array $\{45,42,1;1,6,45\}$
\jour Sib. \`Elektron. Mat. Izv.
\yr 2016
\vol 13
\pages 130--136
\mathnet{http://mi.mathnet.ru/semr661}
\crossref{https://doi.org/10.17377/semi.2016.13.011}
Linking options:
  • https://www.mathnet.ru/eng/semr661
  • https://www.mathnet.ru/eng/semr/v13/p130
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:246
    Full-text PDF :55
    References:65
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024