paper

Isomorphism of Clean Graphs over and Structural Insight into

arXiv:2509.12004

Abstract

Let be a finite ring with identity. The clean graph of a ring is a graph whose vertices are pairs , where is an idempotent element and is a unit of . Two distinct vertices and are adjacent if and only if or . The graph is the induced subgraph of induced by the set . 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 through their graph.

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