Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)

被引:0
|
作者
Avgustinovich, Sergey [1 ]
Mogilnykh, Ivan [1 ]
机构
[1] Novosibirsk State Univ, Sobolev Inst Math, Pr Ac Koptyuga 4, Novosibirsk 630090, Russia
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The problem of the existence of perfect 2-colorings in Johnson graphs J(6, 3) and J(7, 3) is solved in this paper. Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte [3]. This problem of existence of such structures is closely related to Delsarte hypothesis about the nonexistence of nontrivial perfect codes in Johnson graphs, the problem of existence of block schemes, the problem of existence of completely regular codes in Johnson graphs and other well-known mathematical problems. Some auxiliary theorems, which can be applied for treatment of perfect colorings in two colors in other graphs, are given in this paper.
引用
收藏
页码:11 / +
页数:3
相关论文
共 50 条
  • [1] Perfect 3-Colorings of the Johnson Graph J(6,3)
    Alaeiyan, Mehdi
    Abedi, Amirabbas
    Alaeiyan, Mohammadhadi
    [J]. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2020, 46 (06) : 1603 - 1612
  • [2] Perfect 2-colorings of the Johnson graph J(9, 4)
    Mehdi Alaeiyan
    Efat Alaeiyan
    [J]. Mathematical Sciences, 2022, 16 : 133 - 136
  • [3] Perfect 2-colorings of the Johnson graph J(9,4)
    Alaeiyan, Mehdi
    Alaeiyan, Efat
    [J]. MATHEMATICAL SCIENCES, 2022, 16 (02) : 133 - 136
  • [4] Perfect 3-Colorings of the Johnson Graph J(6, 3)
    Mehdi Alaeiyan
    Amirabbas Abedi
    Mohammadhadi Alaeiyan
    [J]. Bulletin of the Iranian Mathematical Society, 2020, 46 : 1603 - 1612
  • [5] Perfect colorings of the Johnson graphs J(8, 3) and J(8, 4) with two colors
    Avgustinovich S.V.
    Mogil'nykh I.Y.
    [J]. Journal of Applied and Industrial Mathematics, 2011, 5 (1) : 19 - 30
  • [6] Perfect 3-colorings of the Johnson graphs J (4,2), J (5,2), J (6,2) and Petersen graph
    Alaeiyan, Mohammad Hadi
    Abedi, Amirabbas
    [J]. ARS COMBINATORIA, 2018, 140 : 199 - 213
  • [7] 2-COLORINGS THAT DECOMPOSE PERFECT GRAPHS
    CHVATAL, V
    LENHART, WJ
    SBIHI, N
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 49 (01) : 1 - 9
  • [8] Perfect 2-colorings of Hamming graphs
    Bespalov, Evgeny A.
    Krotov, Denis S.
    Matiushev, Aleksandr A.
    Taranenko, Anna A.
    Vorob'ev, Konstantin V.
    [J]. JOURNAL OF COMBINATORIAL DESIGNS, 2021, 29 (06) : 367 - 396
  • [9] On the regularity of perfect 2-colorings of the Johnson graph
    I. Yu. Mogil’nykh
    [J]. Problems of Information Transmission, 2007, 43 : 303 - 309
  • [10] On the ruegularity of perfect 2-colorings of the Johnson graph
    Mogil'nykh, I. Yu
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2007, 43 (04) : 303 - 309