Related papers: On the Clean Graph of a Ring

A ring $R$ is feckly clean provided that for any $a\in R$ there exists an element $e\in R$ and a full element $u\in R$ such that $a=e+u, eR(1-e)\subseteq J(R)$. We prove that a ring $R$ is feckly clean if and only if for any $a\in R$, there…

Let $R$ be a commutative ring with unity and $R^{+}$ be $Z^*(R)$ be the additive group and the set of all non-zero zero-divisors of $R$, respectively. We denote by $\mathbb{CAY}(R)$ the Cayley graph $Cay(R^+,Z^*(R))$. In this paper, we…

Let $R$ be a commutative ring with identity and $\Bbb A (R)$ be the set of ideals of $R$ with non-zero annihilator. The annihilator-ideal graph of $R$, denoted by $A_{I} (R) $, is a simple graph with the vertex set $\Bbb A(R)^{\ast} := \Bbb…

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$ is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if $x…

The inclusion ideal graph of a commutative unitary ring $R$ is the (undirected) graph $In(R)$ whose vertices all non-trivial ideals of $R$ and two distinct vertices are adjacent if and only if one of them is a proper subset of the other…

Let $R$ be a commutative ring with unity. The essential ideal graph $\mathcal{E}_{R}$ of $R$, is a graph with a vertex set consisting of all nonzero proper ideals of \textit{R} and two vertices $I$ and $K$ are adjacent if and only if $I+ K$…

A ring $R$ with an involution * is called (strongly) *-clean if every element of $R$ is the sum of a unit and a projection (that commute). All *-clean rings are clean. Va${\rm \check{s}}$ [L. Va${\rm \check{s}}$, *-Clean rings; some clean…

Let $R$ be a commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in…

In this article, the concept of nil clean graph of a ring has been generalised to weakly nil clean graph of a ring and graph theoretic properties like girth, clique number, diameter and chromatic index of the graph have been studied for a…

Let $R$ be a ring with unity. The upper ideal relation graph $\Gamma_U(R)$ of the ring $R$ is a simple undirected graph whose vertex set is the set of all non-unit elements of $R$ and two distinct vertices $x, y$ are adjacent if and only if…

Let $R$ be a commutative ring with ${\Bbb{A}}(R)$ its set of ideals with nonzero annihilator. In this paper and its sequel, we introduce and investigate the {\it annihilating-ideal graph} of $R$, denoted by ${\Bbb{AG}}(R)$. It is the…

A ring R is a Zhou nil-clean ring if every element in R is the sum of two tripotents and a nilpotent that commute. In this paper, Zhou nil-clean rings are further discussed with an emphasis on their relations with polynomials, idempotents…

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of R and two vertices are adjacent if their product is zero. The compressed zero divisor graph $\Gamma_E[R]$ is…

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

This paper introduces a new approach to associating a graph with a commutative ring. Let $R$ be a commutative ring with identity. The unit-zero divisor graph of a commutative ring $R$, denoted by $G_{UZ}(R)$, offers a novel framework for…

A ring $R$ is said to be clean if each element of $R$ can be written as the sum of a unit and an idempotent. $R$ is said to be weakly clean if each element of $R$ is either a sum or a difference of a unit and an idempotent, and $R$ is said…

A ring $R$ is (strongly) 2-nil-clean if every element in $R$ is the sum of two idempotents and a nilpotent (that commute). Fundamental properties of such rings are discussed. Let $R$ be a 2-primal ring. If $R$ is strongly 2-nil-clean, we…

A graph $G$ is called matching covered if all of its edges are contained in some perfect matching of $G$. Furthermore, a cycle $C \subseteq G$ is called conformal if $G - V(C)$ has a perfect matching and $G$ itself is called cycle-conformal…

The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In [Gutman, Cruz, Rada, Wiener index of Eulerian Graphs, Discrete…

A ring $R$ is called strongly clean if every element of $R$ is the sum of a unit and an idempotent that commute with each other. A recent result of Borooah, Diesl and Dorsey \cite{BDD05a} completely characterized the commutative local rings…