Non-trivial subring perfect codes in unit graph of Boolean rings
The aim of this paper is to investigate the non-trivial subring perfect codes in a unit graph associated with the Boolean rings. We prove a subring perfect code of size 2n-1, where n 3 2, in the unit graphs associated with the finite Boolean rings R . Moreover, we give a necessary and sufficient con...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2022
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/102882/1/NorHanizaSarmin2022_NonTrivialSubringPerfectCodes.pdf http://eprints.utm.my/id/eprint/102882/ http://dx.doi.org/10.11113/mjfas.v18n3.2503 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Language: | English |