Skip to content

A graph with respect to idempotents of a Ring-II

Jul 2026 · Journal of Algebra and its Applications · 0 citations

Abstract

Let [Formula: see text] be a ring with unity. The idempotent graph [Formula: see text] of a ring [Formula: see text] is an undirected simple graph whose vertex set is [Formula: see text] and two vertices [Formula: see text], [Formula: see text] are adjacent if and only if [Formula: see text] is an idempotent element of [Formula: see text]. Razaghi et al. (A graph with respect to idempotents of a ring. J. Algebra Appl., 20(6):2150105, 8, 2021) studied basic properties of [Formula: see text] such as connectedness, diameter and girth. In this article, first we correct a structural result obtained by Razaghi et al. and determine the precise structure of the idempotent graph of local rings. Further, we obtain a necessary and sufficient condition on the ring [Formula: see text] such that [Formula: see text] is planar. We prove that [Formula: see text] is an outerplanar graph if and only if [Formula: see text] is a local ring. Moreover, we classify all the finite commutative rings [Formula: see text] such that [Formula: see text] is claw-free, cograph, split graph and threshold graph, respectively. We conclude that for a finite non-local commutative ring, the latter two graph classes of [Formula: see text] are equivalent if and only if [Formula: see text] is a Boolean ring.

View source

Similar papers

Sep 2026

On The Line Graph of Graph with Respect to Idempotents of a Ring

Let [Formula: see text] be a ring with nonzero identity and [Formula: see text] denotes the set of idempotents in [Formula: see text]. A graph of [Formula: see text] with respect to idempotents [Formula: see text] is a graph whose vertices are elements of [Formula: see text] and two vertices [Formula: see text] and [Fo...

Dipika B. Patil, Avinash Patil · 0 citations
Oct 2026

A palindromicity criterion for the h -polynomials of bipartite edge rings

We study a symmetry problem for the [Formula: see text]-polynomials of edge rings of bipartite graphs. Let [Formula: see text] be a bipartite graph and write [Formula: see text]. We prove that if [Formula: see text] is pseudo-Gorenstein and [Formula: see text], then [Formula: see text] is Gorenstein. Equivalently, unde...

Yuta Hatasa · 0 citations
Sep 2026

Amalgamated Rings with r -Clean Properties

Let [Formula: see text] be a ring with identity. An element [Formula: see text] is called [Formula: see text]-clean if it can be written as the sum of an idempotent and a von Neumann regular element of [Formula: see text]; the ring [Formula: see text] is said to be [Formula: see text]-clean if every element of [Formula...

Dian Ariesta Yuwaningsih, Hwankoo Kim, I. E. Wijayanti et al. · 0 citations
Sep 2026

Oriented partial permutation semigroups with restricted range

Let [Formula: see text] be a finite chain with [Formula: see text] elements [Formula: see text], and let [Formula: see text] be the semigroup of all either orientation-preserving or orientation-reversing injective partial transformations of [Formula: see text]. In this paper, for any nonempty subset [Formula: see text]...

De-Biao Li · 0 citations
Sep 2026

The Characteristic Polynomials of Uniform Double Starlike Hypertrees and Uniform Squids

A [Formula: see text]-power hypergraph is obtained from a graph by adding [Formula: see text] new vertices to each edge of the graph. Let [Formula: see text] be a graph obtained by adding [Formula: see text] edges and [Formula: see text] edges to the two pendant vertices of a path of length 2, respectively. A [Formula:...

Su-Wan Huang, Cun-Xiang Duan, Qian Zhao · 0 citations
Aug 2026

A bound for the chromatic number of (P2 ∪ P4,diamond)-free graphs

A hereditary class [Formula: see text] of graphs is [Formula: see text]-bounded if there is a [Formula: see text]-binding function, say [Formula: see text], such that [Formula: see text], for every [Formula: see text], where [Formula: see text] denotes the chromatic (clique) number of [Formula: see text]. A [Formula: s...

Li Zhang, Xia Hong · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.