Investigating ۱-perfect code using Dominating set

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

Keywords:

Perfect ۲-coloring , ۱- perfect code , dominating set , Johnson graph

Authors

- -

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

- -

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

Certificate
من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

https://civilica.com/doc/1561118

شناسه ملی سند علمی:

JR_IJNAA-12-2_038

تاریخ نمایه سازی: 11 آذر 1401

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:

-, - and -, -,1400,Investigating ۱-perfect code using Dominating set,https://civilica.com/doc/1561118

Scientometrics

The specifications of the publisher center of this Paper are as follows:

Ranking of Semnan University09125320704

Type of center: دانشگاه دولتی

Paper count: 11,971

In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.