On the idempotent graph of a ring
Abstract
Let R be a ring with unity. The idempotent graph GId(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 GId(R) is planar. We prove that GId(R) cannot be an outerplanar graph. Moreover, we classify all the finite non-local commutative rings R such that GId(R) is a cograph, split graph and threshold graph, respectively. We conclude that latter two graph classes of GId(R) are equivalent if and only if R Z2 × Z2 × ·s × Z2.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.