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: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
World Scientific and Engineering Academy and Society
2021
|
| Subjects: | |
| Online Access: | 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|