On the Clean Graph of Commutative Artinian Rings

R. Singh, M. Habibi and S. C. Patekar

International Journal of Mathematics and Mathematical Sciences, 2025, vol. 2025, 1-14

Abstract: For a commutative Artinian ring R with unity, the clean graph ClR is a graph with vertices in the form of an ordered pair e,u, where e is an idempotent and u is a unit of ring R, respectively. Two distinct vertices e,u and f,v are adjacent in ClR if and only if ef=fe=0 or uv=vu=1. In this study, we consider Cl2R as the subgraph of ClR induced by e is a non−zero idempotent element of R. We show that Cl2R contains the Hamiltonian cycle. Also, we compute the graphic sequence, matching number, vertex cover number, edge cover number, vertex connectivity, and edge connectivity of Cl2R. As an application, we compute the Wiener and the first Zagreb indices of Cl2R. Moreover, we give the formula for the number of self invertible elements of Zn.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ijmms/2025/8677973.pdf (application/pdf)
http://downloads.hindawi.com/journals/ijmms/2025/8677973.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:8677973

DOI: 10.1155/ijmm/8677973

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().