Investigating 1-perfect code using Dominating set

Document Type : Research Paper

Authors

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

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

10.22075/ijnaa.2019.18237.1997

Abstract

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.

Keywords