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.
机构:
Chinese Univ Hong Kong, Fac Med, Sch Pharm, Shatin, Hong Kong, Peoples R ChinaChinese Univ Hong Kong, Fac Med, Sch Pharm, Shatin, Hong Kong, Peoples R China
Wong, Yin Cheong
Zhang, Li
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Univ Hong Kong, Fac Med, Sch Pharm, Shatin, Hong Kong, Peoples R ChinaChinese Univ Hong Kong, Fac Med, Sch Pharm, Shatin, Hong Kong, Peoples R China
Zhang, Li
Lin, Ge
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Univ Hong Kong, Dept Pharmacol, Shatin, Hong Kong, Peoples R ChinaChinese Univ Hong Kong, Fac Med, Sch Pharm, Shatin, Hong Kong, Peoples R China
Lin, Ge
Zuo, Zhong
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Univ Hong Kong, Fac Med, Sch Pharm, Shatin, Hong Kong, Peoples R ChinaChinese Univ Hong Kong, Fac Med, Sch Pharm, Shatin, Hong Kong, Peoples R China
机构:
Univ Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South AfricaUniv Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South Africa
Henning, Michael A.
Yeo, Anders
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South Africa
Univ Southern Denmark, Dept Math & Comp Sci, Campusvej 55, DK-5230 Odense M, DenmarkUniv Johannesburg, Dept Pure & Appl Math, ZA-2006 Auckland Pk, South Africa