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], 2015, Volume 12, Pages 795–801
DOI: https://doi.org/10.17377/semi.2015.12.065 (Mi semr628) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Mathematical logic, algebra and number theory

Automorphisms of a distance-regular graph with intersection array $\{100,66,1;1,33,100\}$

K. S. Efimova, A. A. Makhnevb

a Ural Federal University, str. Mira, 15, 620000, Ekaterinburg, Russia
b N.N. Krasovsky Institute of Mathematics and Meckhanics, str. S. Kovalevskoy, 4, 620990, Ekaterinburg, Russia
Full-text PDF (144 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17377/semi.2015.12.065
Abstract: A. A. Makhnev and D. V. Paduchikh have found intersection arrays of distance-regular graphs, in which neighborhoods of vertices are strongly-regular graphs with second eigenvalue $3$. A. A. Makhnev suggested the program to research of automorphisms of these distance-regular graphs. In this paper it is obtained possible orders and subgraphs of fixed points of automorphisms of a hypothetical distance-regular graph with intersection array $\{100,66,1;1,33,100\}$. In particular, this graph does not vertex symmetric.
Keywords: distance-regular graph, vertex symmetric graph.
Funding agency Grant number
Russian Science Foundation 14-11-00061
Ministry of Education and Science of the Russian Federation 02.A03.21.0006
Russian Foundation for Basic Research 14-01-31298 мол_а
This work is partially supported by RSF, project 14-11-00061 (theorem 1 and corollary) and by the program of the government support of leading universities of Russian Federation, agreement №02.A03.21.0006 from 27.08.2013 (theorem 2). Thirst author also supported by the RFBR (project 14-01-31298).
Received October 27, 2015, published November 6, 2015
Document Type: Article
UDC: 519.17
MSC: 05C25
Language: English
Citation: K. S. Efimov, A. A. Makhnev, “Automorphisms of a distance-regular graph with intersection array $\{100,66,1;1,33,100\}$”, Sib. Èlektron. Mat. Izv., 12 (2015), 795–801
Citation in format AMSBIB
\Bibitem{EfiMak15}
\by K.~S.~Efimov, A.~A.~Makhnev
\paper Automorphisms of a distance-regular graph with intersection array $\{100,66,1;1,33,100\}$
\jour Sib. \`Elektron. Mat. Izv.
\yr 2015
\vol 12
\pages 795--801
\mathnet{http://mi.mathnet.ru/semr628}
\crossref{https://doi.org/10.17377/semi.2015.12.065}
Linking options:
  • https://www.mathnet.ru/eng/semr628
  • https://www.mathnet.ru/eng/semr/v12/p795
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:277
    Full-text PDF :56
    References:53
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024