Investigating 1-perfect code using Dominating set

نویسندگان
Halataei, Fatemeh ID 1
Mohammadian, Saeed ID 2

1 Faculty of Mathematics, Statistics, and Computer Science, Semnan University, Semnan, Iran

2 Faculty of Mathematics, Statistics and Computer Science, Semnan University, Semnan, Iran

doi
10.22075/ijnaa.2019.18237.1997
چکیده

In this article, we investigate the relation between dominating sets and 1-perfect codes. We also study perfect colorings of some Johnson graphs in two colors using linear programming problem.

کلیدواژه‌ها
Perfect 2-coloring, 1- perfect code, dominating set, Johnson graph