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


Probl. Peredachi Inf., 2007, Volume 43, Issue 4, Pages 37–44 (Mi ppi25)  

This article is cited in 6 scientific papers (total in 6 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

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.

Full text: PDF file (896 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2007, 43:4, 303–309

Bibliographic databases:

UDC: 621.391.1:519.1
Received: 28.12.2006
Revised: 29.08.2007

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://www.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{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000255782900003}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-45349095734}


Linking options:
  • http://mi.mathnet.ru/eng/ppi25
  • http://mi.mathnet.ru/eng/ppi/v43/i4/p37

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Avgustinovich S., Mogilnykh I., “Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)”, Coding Theory and Applications, Proceedings, Lecture Notes in Computer Science, 5228, 2008, 11–19  crossref  mathscinet  zmath  isi
    2. I. Yu. Mogilnykh, “O nesuschestvovanii nekotorykh sovershennykh 2-raskrasok grafov Dzhonsona”, Diskretn. analiz i issled. oper., 16:5 (2009), 52–68  mathnet  mathscinet  zmath
    3. S. V. Avgustinovich, I. Yu. Mogilnykh, “Perfect 2-colorings of Johnson graphs $J(8,3)$ and $J(8,4)$”, J. Appl. Industr. Math., 5:1 (2011), 19–30  mathnet  crossref  mathscinet  zmath
    4. D. B. Khoroshilova, “O sovershennykh raskraskakh rebernykh grafov”, Diskretn. analiz i issled. oper., 17:6 (2010), 77–95  mathnet  mathscinet  zmath
    5. Alaeiyan M., Abedi A., “Well-Partitioned and Balanced Well-Partitioned Graphs”, ARS Comb., 138 (2018), 387–392  mathscinet  zmath  isi
    6. J. Borges, J. Rifà, V. A. Zinoviev, “On completely regular codes”, Problems Inform. Transmission, 55:1 (2019), 1–45  mathnet  crossref  crossref  isi  elib
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:496
    Full text:86
    References:35
    First page:20

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020