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 |
| id |
my.utm.102882 |
|---|---|
| record_format |
eprints |
| spelling |
my.utm.1028822023-09-26T06:10:27Z http://eprints.utm.my/id/eprint/102882/ Non-trivial subring perfect codes in unit graph of Boolean rings Mudaber, Mohammad Hassan Sarmin, Nor Haniza Gambo, Ibrahim QA Mathematics 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 condition for a subring of an infinite Boolean ring R to be a perfect code of size infinity in the unit graph. Penerbit UTM Press 2022-05-01 Article PeerReviewed application/pdf en http://eprints.utm.my/id/eprint/102882/1/NorHanizaSarmin2022_NonTrivialSubringPerfectCodes.pdf Mudaber, Mohammad Hassan and Sarmin, Nor Haniza and Gambo, Ibrahim (2022) Non-trivial subring perfect codes in unit graph of Boolean rings. Malaysian Journal of Fundamental and Applied Sciences, 18 (3). pp. 374-382. ISSN 2289-599X http://dx.doi.org/10.11113/mjfas.v18n3.2503 DOI:10.11113/mjfas.v18n3.2503 |
| institution |
Universiti Teknologi Malaysia |
| building |
UTM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Teknologi Malaysia |
| content_source |
UTM Institutional Repository |
| url_provider |
http://eprints.utm.my/ |
| language |
English |
| topic |
QA Mathematics |
| spellingShingle |
QA Mathematics Mudaber, Mohammad Hassan Sarmin, Nor Haniza Gambo, Ibrahim Non-trivial subring perfect codes in unit graph of Boolean rings |
| description |
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 condition for a subring of an infinite Boolean ring R to be a perfect code of size infinity in the unit graph. |
| format |
Article |
| author |
Mudaber, Mohammad Hassan Sarmin, Nor Haniza Gambo, Ibrahim |
| author_facet |
Mudaber, Mohammad Hassan Sarmin, Nor Haniza Gambo, Ibrahim |
| author_sort |
Mudaber, Mohammad Hassan |
| title |
Non-trivial subring perfect codes in unit graph of Boolean rings |
| title_short |
Non-trivial subring perfect codes in unit graph of Boolean rings |
| title_full |
Non-trivial subring perfect codes in unit graph of Boolean rings |
| title_fullStr |
Non-trivial subring perfect codes in unit graph of Boolean rings |
| title_full_unstemmed |
Non-trivial subring perfect codes in unit graph of Boolean rings |
| title_sort |
non-trivial subring perfect codes in unit graph of boolean rings |
| publisher |
Penerbit UTM Press |
| publishDate |
2022 |
| url |
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 |
| _version_ |
1778160796445966336 |