Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 2007, Volume 43, Issue 4, Pages 37–44 (Mi ppi25)  
This article is cited in 11 scientific papers (total in 11 papers)

Coding Theory

On the Regularity of Perfect Two-Colorings of the Johnson Graph

I. Yu. Mogil'nykhab

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Novosibirsk State University
Full-text PDF (896 kB) Citations (11)
References:
PDF
HTML
Abstract: We study perfect colorings of the Johnson graph in two colors. We give sufficient conditions for a perfect coloring of the Johnson graph to be $k$-regular and present examples of perfect colorings. The proof of the theorem is in many respects similar to the proof of the result by Etzion and Schwartz [1] on $k$-regularity of perfect codes.
Received: 28.12.2006
Revised: 29.08.2007
English version:
Problems of Information Transmission, 2007, Volume 43, Issue 4, Pages 303–309
DOI: https://doi.org/10.1134/S0032946007040035
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:519.1
Language: Russian
Citation: I. Yu. Mogil'nykh, “On the Regularity of Perfect Two-Colorings of the Johnson Graph”, Probl. Peredachi Inf., 43:4 (2007), 37–44; Problems Inform. Transmission, 43:4 (2007), 303–309
Citation in format AMSBIB
\Bibitem{Mog07}
\by I.~Yu.~Mogil'nykh
\paper On the Regularity of Perfect Two-Colorings of the Johnson Graph
\jour Probl. Peredachi Inf.
\yr 2007
\vol 43
\issue 4
\pages 37--44
\mathnet{http://mi.mathnet.ru/ppi25}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2406142}
\zmath{https://zbmath.org/?q=an:1143.05031}
\transl
\jour Problems Inform. Transmission
\yr 2007
\vol 43
\issue 4
\pages 303--309
\crossref{https://doi.org/10.1134/S0032946007040035}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000255782900003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-45349095734}
Linking options:
  • https://www.mathnet.ru/eng/ppi25
  • https://www.mathnet.ru/eng/ppi/v43/i4/p37
    • This publication is cited in the following 11 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:640
    Full-text PDF :130
    References:50
    First page:20
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024