Perfect codes over induced subgraphs of unit graphs of ring of integers modulo n
The induced subgraph of a unit graph with vertex set as the idempotent elements of a ring R is a graph which is obtained by deleting all non idempotent elements of R. Let C be a subset of the vertex set in a graph Γ. Then C is called a perfect code if for any x, y ∈ C the union of the closed neighbo...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
World Scientific and Engineering Academy and Society
2021
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/94479/1/NorHanizaSarmin2021_PerfectCodesOverInduced.pdf http://eprints.utm.my/id/eprint/94479/ http://dx.doi.org/10.37394/23206.2021.20.41 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Universiti Teknologi Malaysia |
| 語言: | English |
| 總結: | The induced subgraph of a unit graph with vertex set as the idempotent elements of a ring R is a graph which is obtained by deleting all non idempotent elements of R. Let C be a subset of the vertex set in a graph Γ. Then C is called a perfect code if for any x, y ∈ C the union of the closed neighbourhoods of x and y gives the the vertex set and the intersection of the closed neighbourhoods of x and y gives the empty set. In this paper, the perfect codes in induced subgraphs of the unit graphs associated with the ring of integer modulo n, Zn that has the vertex set as idempotent elements of Zn are determined. The rings of integer modulo n are classified according to their induced subgraphs of the unit graphs that accept a subset of a ring Zn of different sizes as the perfect codes. |
|---|