PERFECT CODES IN INDUCED SUBGRAPH OF UNIT GRAPH ASSOCIATED WITH SOME COMMUTATIVE RINGS

Authors

  • Mohammad Hassan Mudaber Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310, Johor Bahru, Malaysia
  • Nor Haniza Sarmin Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310, Johor Bahru, Malaysia https://orcid.org/0000-0003-4291-5746
  • Ibrahim Gambo Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310, Johor Bahru, Malaysia https://orcid.org/0000-0003-4405-4492

DOI:

https://doi.org/10.11113/jurnalteknologi.v84.17982

Keywords:

Commutative ring, unit of ring, unit graph, induced subgraph, perfect code

Abstract

The unit graph associated with a ring  is the graph whose vertices are elements of , and two different vertices  and are adjacent if and only if where is the set of unit elements of  The aim of this paper is to present the perfect codes in induced subgraph of unit graph associated with some commutative rings with unity in which its vertex set is We characterize some families of commutative rings with induced subgraphs of unit graphs accepting the non-trivial perfect codes, and some other families of commutative rings with induced subgraphs of unit graphs which do not accept perfect codes.

References

Ashrafi, N., Maimani, H. R., Pournaki, M. R., and Yassemi, S. 2010. Unit Graphs Associated with Rings. Communication in Algebra. 38(8): 2851-2871.

DOI: https://doi.org/10.1080/00927870903095574.

Akbari, S., Estaji, E., and Khorsandi, M. R. 2015. On the Unit Graph of a Non-Commutative Ring. Algebra Colloquium. 22 (spec01): 817-822.

DOI: https://doi.org/10.1142/S100538671500070X.

Maimani. H. R., Pournaki. M. R., and Yassemi. S. 2011. Necessary and Sufficient Conditions for Unit Graphs To Be Hamiltonian. Pacific Journal of Mathematics. 249(2): 419-429. DOI: 10.2140/pjm.2011.249.419.

Kiani, S., Maimani, H. R., Pournaki, M. R., and Yassemi, S. 2015. Classification of Rings with Unit Graphs Having Domination Number Less Than Four. Rend. Sem.Mat. Univ. Padova. 133: 173-195.

DOI: 10.4171/RSMUP/133-9.

Su, H. and Zhou, Y. 2014. On the Girth of the Unit Graph of a Ring. Journal of Algebra and its Application. 13(02): 1350082.

DOI: https://doi.org/10.1142/S0219498813500825.

Su, H. and Wei, Y. 2019. The Diameter of Unit Graphs of Rings. Taiwanese Journal of Mathematics. 23(1): 1-10.

DOI: 10.11650/tjm/180602.

Hashemi, E., Abdi, M., Alhevaz, A., and Su, H. 2020. Domination Number of Graphs Associated with Rings. Journal of Algebra and Its Applications. 19(01): 2050009.

DOI: https://doi.org/10.1142/S0219498820500097.

Shannon, C. E. 1948. A Mathematical Theory of Communication. The Bell System Technical Journal. 27(3): 379-423.

DOI: 10.1002/j.1538-7305.1948.tb01338.x.

Hamming, R. W. 1950. Error-Detecting and Error-Correcting Codes. The Bell system Technical Journal. 29(2):147-60.

DOI: 10.1002/j.1538-7305.1950.tb00463.x.

Biggs, N. 1973. Perfect Codes in Graphs. Journal of Combinatorial Theory, Series B. 15( 3): 289-296.

DOI: https://doi.org/10.1016/0095-8956(73)90042-7.

Kratochvıl, J. 1985. 1-Perfect Codes Over Self-complementary Graphs. Commentationes Mathematicae Universitatis Carolinae. 26(3): 589-95.

https://dml.cz/handle/10338.dmlcz/106395.

Kratochvil, J. 1986. Perfect Codes over Graphs. Journal of Combinatorial Theory, Series B. 40(2): 224-228.

DOI: https://doi.org/10.1016/0095-8956(86)90079-1.

Dvořáková-Rulićová, I. 1988. Perfect Codes in Regular Graphs. Commentationes Mathematicae Universitatis Carolinae. 29(1): 79-83.

https://dml.cz/handle/10338.dmlcz/106599.

Cull, P and Nelson, I. 1999. Error-Correcting Codes on the Towers of Hanoi Graphs. Discrete Mathematics. 208: 157-75. DOI: https://doi.org/10.1016/S0012-365X(99)00070-9.

Ma, X., Fu, R., Lu, X., Guo, M., and Zhao, Z. 2017. Perfect Codes in Power Graphs of Finite Groups. Open Mathematics. 15(1): 1440-1449.

DOI: https://doi.org/10.1515/math-2017-0123.

Ma, X. 2020. Perfect Codes in Proper Reduced Power Graphs of Finite Groups. Communications in Algebra. 48(9): 3881-3890.

DOI: https://doi.org/10.1080/00927872.2020.1749845.

Chen, J., Wang, Y., and Xia, B. 2020. Characterization of Subgroup Perfect Codes in Cayley Graphs. Discrete Math. 343(5): 111813.

DOI: https://doi.org/10.1016/j.disc.2020.111813.

Huang, H., Xia, B., and Zhou, S. 2018. Perfect Codes in Cayley Graphs. SIAM Journal on Discrete Mathematics. 32(1): 548-559.

DOI: https://doi.org/10.1137/17M1129532.

Zhang, J., and Zhou, S. 2021. On Subgroup Perfect Codes in Cayley Graphs. European Journal of Combinatorics. 2021. 91: 103228.

DOI: https://doi.org/10.1016/j.ejc.2020.103228.

Ma, X., Walls, G. L., Wang, K., and Zhou, S. 2020. Subgroup Perfect Codes in Cayley Graphs. SIAM Journal on Discrete Mathematics. 34(3): 1909-1921.

DOI: https://doi.org/10.1137/19M1258013.

Zaid, N., Sarmin, N. H., Khasraw, S. M. S., Gambo, I., and Zai, N. A. F. O. 2021. The Perfect Codes of Commuting Zero Divisor Graph of Some Matrices of Dimension Two. Journal of Physics: Conference Series. 1998: 012070.

Chartrand, G., and Zhang, P. 2013. A First Course in Graph Theory. Dover Publications, New York.

Downloads

Published

2022-07-26

Issue

Section

Science and Engineering

How to Cite

PERFECT CODES IN INDUCED SUBGRAPH OF UNIT GRAPH ASSOCIATED WITH SOME COMMUTATIVE RINGS . (2022). Jurnal Teknologi, 84(5), 131-136. https://doi.org/10.11113/jurnalteknologi.v84.17982