English

On the idempotent graph of a ring

Combinatorics 2023-06-16 v1 Rings and Algebras

Abstract

Let RR be a ring with unity. The \emph{idempotent graph} GId(R)G_{\text{Id}}(R) of a ring RR is an undirected simple graph whose vertices are the set of all the elements of ring RR and two vertices xx and yy are adjacent if and only if x+yx+y is an idempotent element of RR. In this paper, we obtain a necessary and sufficient condition on the ring RR such that GId(R)G_{\text{Id}}(R) is planar. We prove that GId(R)G_{\text{Id}}(R) cannot be an outerplanar graph. Moreover, we classify all the finite non-local commutative rings RR such that GId(R)G_{\text{Id}}(R) is a cograph, split graph and threshold graph, respectively. We conclude that latter two graph classes of GId(R)G_{\text{Id}}(R) are equivalent if and only if RZ2×Z2××Z2R \cong \mathbb{Z}_2 \times \mathbb{Z}_2 \times \cdots \times \mathbb{Z}_2.

Keywords

Cite

@article{arxiv.2306.08327,
  title  = {On the idempotent graph of a ring},
  author = {Praveen Mathil and Barkha Baloda and Jitender Kumar},
  journal= {arXiv preprint arXiv:2306.08327},
  year   = {2023}
}

Comments

3 figures

R2 v1 2026-06-28T11:04:45.459Z