Universiti Teknologi Malaysia Institutional Repository

Non-trivial subring perfect codes in unit graph of Boolean rings

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

[img] PDF
1MB

Official URL: http://dx.doi.org/10.11113/mjfas.v18n3.2503

Abstract

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.

Item Type:Article
Uncontrolled Keywords:Boolean ring, perfect code, subring, unit graph
Subjects:Q Science > QA Mathematics
Divisions:Science
ID Code:102882
Deposited By: Yanti Mohd Shah
Deposited On:26 Sep 2023 06:10
Last Modified:26 Sep 2023 06:10

Repository Staff Only: item control page