On the idempotent graph of a ring

From MaRDI portal
Publication:6440261

arXiv2306.08327MaRDI QIDQ6440261FDOQ6440261


Authors: Jitender Kumar Edit this on Wikidata


Publication date: 14 June 2023

Abstract: Let R be a ring with unity. The emph{idempotent graph} GextId(R) of a ring R is an undirected simple graph whose vertices are the set of all the elements of ring R and two vertices x and y are adjacent if and only if x+y is an idempotent element of R. In this paper, we obtain a necessary and sufficient condition on the ring R such that GextId(R) is planar. We prove that GextId(R) cannot be an outerplanar graph. Moreover, we classify all the finite non-local commutative rings R such that GextId(R) is a cograph, split graph and threshold graph, respectively. We conclude that latter two graph classes of GextId(R) are equivalent if and only if RcongmathbbZ2imesmathbbZ2imescdotsimesmathbbZ2.













This page was built for publication: On the idempotent graph of a ring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440261)