On the idempotent graph of a ring
Praveen Mathil, Barkha Baloda, Jitender Kumar

TL;DR
This paper investigates the properties of the idempotent graph of a ring, providing conditions for planarity, and classifies certain finite rings based on the graph's structure, such as being a cograph, split, or threshold graph.
Contribution
It establishes a necessary and sufficient condition for the idempotent graph to be planar and classifies finite non-local commutative rings where the graph is a cograph, split, or threshold.
Findings
G_{Id}(R) cannot be outerplanar.
Characterization of rings with planar idempotent graphs.
Equivalence of split and threshold graph classes occurs only for R ≅ Z_2 × ... × Z_2.
Abstract
Let be a ring with unity. The \emph{idempotent graph} of a ring is an undirected simple graph whose vertices are the set of all the elements of ring and two vertices and are adjacent if and only if is an idempotent element of . In this paper, we obtain a necessary and sufficient condition on the ring such that is planar. We prove that cannot be an outerplanar graph. Moreover, we classify all the finite non-local commutative rings such that is a cograph, split graph and threshold graph, respectively. We conclude that latter two graph classes of are equivalent if and only if .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Advanced Topics in Algebra · Finite Group Theory Research
