Algebra i logika
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



Algebra Logika:
Year:
Volume:
Issue:
Page:
Find






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


Algebra i logika, 2018, Volume 57, Number 2, Pages 214–231
DOI: https://doi.org/10.17377/alglog.2018.57.205
(Mi al844)
 

This article is cited in 4 scientific papers (total in 4 papers)

Edge-symmetric distance-regular coverings of complete graphs: the almost simple case

A. A. Makhnev, D. V. Paduchikh, L. Yu. Tsiovkina

Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi 16, Yekaterinburg, 620990 Russia
Full-text PDF (220 kB) Citations (4)
References:
Abstract: We complete the classification of edge-symmetric distance-regular coverings of complete graphs with $r\not\in\{2,k,(k-1)/\mu\}$ for the case of the almost simple action of an automorphism group of a graph on a set of its antipodal classes; here $r$ is the order of an antipodal class.
Keywords: edge-symmetric graph, distance-regular graph, complete graph, covering, antipodal class.
Funding agency Grant number
Russian Science Foundation 14-11-00061-П
Supported by Russian Science Foundation, project 14-11-00061-P.
Received: 16.09.2016
Revised: 11.07.2017
English version:
Algebra and Logic, 2018, Volume 57, Issue 2, Pages 141–152
DOI: https://doi.org/10.1007/s10469-018-9486-5
Bibliographic databases:
Document Type: Article
UDC: 519.17+512.54
Language: Russian
Citation: A. A. Makhnev, D. V. Paduchikh, L. Yu. Tsiovkina, “Edge-symmetric distance-regular coverings of complete graphs: the almost simple case”, Algebra Logika, 57:2 (2018), 214–231; Algebra and Logic, 57:2 (2018), 141–152
Citation in format AMSBIB
\Bibitem{MakPadTsi18}
\by A.~A.~Makhnev, D.~V.~Paduchikh, L.~Yu.~Tsiovkina
\paper Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
\jour Algebra Logika
\yr 2018
\vol 57
\issue 2
\pages 214--231
\mathnet{http://mi.mathnet.ru/al844}
\crossref{https://doi.org/10.17377/alglog.2018.57.205}
\transl
\jour Algebra and Logic
\yr 2018
\vol 57
\issue 2
\pages 141--152
\crossref{https://doi.org/10.1007/s10469-018-9486-5}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000440418100005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85050310303}
Linking options:
  • https://www.mathnet.ru/eng/al844
  • https://www.mathnet.ru/eng/al/v57/i2/p214
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:298
    Full-text PDF :23
    References:36
    First page:6
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024