The perfect codes of commuting zero divisor graph of some matrices of dimension two

• Main Authors: Zaid, N., Sarmin, N. H., Khasraw, S. M. S., Gambo, I., Omar Zai, N. A. F.
• Format: Conference or Workshop Item
• Language: English
• Published: 2021
• Subjects: QA Mathematics
• Online Access: http://eprints.utm.my/id/eprint/95666/1/NurhidayahZaid2021_ThePerfectCodesofCommutingZero.pdf; http://eprints.utm.my/id/eprint/95666/; http://dx.doi.org/10.1088/1742-6596/1988/1/012070
• Institution: Universiti Teknologi Malaysia

The study of graph properties has gathered many attentions in the past years. The graph properties that are commonly studied include the chromatic number, the clique number and the domination number of a finite graph. In this study, a type of graph properties, which is the perfect code is studied. The perfect code is originally used in coding theory, then extended to other fields including graph theory. Hence, in this paper, the perfect code is determined for the commuting zero divisor graphs of some finite rings of matrices. First, the commuting zero divisor graph of the finite rings of matrices is constructed where its vertices are all zero divisors of the ring and two distinct vertices, say x and y, are adjacent if and only if xy = yx = 0. Then, from the vertex set of the graph, the neighborhood elements of the vertices are determined in order to compute the perfect codes of the graph.