English

Isomorphism of Clean Graphs over $\mathbb{Z}_n$ and Structural Insight into $M_2(\mathbb{Z}_p)$

Combinatorics 2025-09-16 v1 Rings and Algebras

Abstract

Let RR be a finite ring with identity. The clean graph Cl(R)Cl(R) of a ring RR is a graph whose vertices are pairs (e,u)(e, u), where ee is an idempotent element and uu is a unit of RR. Two distinct vertices (e,u)(e, u) and (f,v)(f, v) are adjacent if and only if ef=fe=0ef = fe = 0 or uv=vu=1uv = vu = 1. The graph Cl2(R)Cl_2(R) is the induced subgraph of Cl(R)Cl(R) induced by the set {(e,u):e is a nonzero idempotent and u is a unit of R}\{(e, u): e \text{ is a nonzero idempotent and } u \text{ is a unit of } R\}. In this study, we present properties that arise from the isomorphism of two clean graphs and conditions under which two clean graphs over direct product rings are isomorphic. We also examine the structure of the clean graph over the ring M2(Zp)M_2(\mathbb{Z}_p) through their Cl2Cl_2 graph.

Keywords

Cite

@article{arxiv.2509.12004,
  title  = {Isomorphism of Clean Graphs over $\mathbb{Z}_n$ and Structural Insight into $M_2(\mathbb{Z}_p)$},
  author = {Felicia Servina Djuang and Indah Emilia Wijayanti and Yeni Susanti},
  journal= {arXiv preprint arXiv:2509.12004},
  year   = {2025}
}

Comments

13 pages, 0 figures, already presented in the 8th Biennial International Group Theory Conference