Investigating ۱-perfect code using Dominating set

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.

Investigating 1-perfect code using Dominating set Keywords:

Perfect 2-coloring , 1- perfect code , dominating set , Johnson graph

Investigating 1-perfect code using Dominating set authors

- -

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

- -

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

Certificate
I'm the author of the paper

Export:

Link to this Paper:

https://civilica.com/doc/1561118

Document National Code:

JR_IJNAA-12-2_038

Index date: 2 December 2022

How to cite:

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

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

در داخل متن نیز هر جا که به عبارت و یا دستاوردی از این Paper اشاره شود پس از ذکر مطلب، در داخل پارانتز، مشخصات زیر نوشته می شود.
برای بار اول: (1400, -, -؛ - -)
برای بار دوم به بعد: (1400, -؛ -)
برای آشنایی کامل با نحوه مرجع نویسی لطفا بخش راهنمای سیویلیکا (مرجع دهی) را ملاحظه نمایید.

Scientometrics

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

Ranking of Semnan University09125320704

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

Paper count: 14,089

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.