Related papers: Weakly nil clean graphs of rings
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…
We characterize the nil clean matrix rings over fields. As a by product, it is proved that the full matrix rings with coefficients in commutative nil-clean rings are nil-clean, and we obtain a complete characterization of the finite rank…
Let $R$ be a commutative ring with $1\not = 0$, $Z(R)$ be the set of all zero-divisors of $R$, and $n \geq 1$. This paper introduces the $n$-total graph of a commutative ring $R$. The $n$-total graph of a commutative ring $R$, denoted by…
Various authors have been generalizing some unital ring properties to nonunital rings. We consider properties related to cancellation of modules (being unit-regular, having stable range one, being directly finite, exchange, or clean) and…
We consider in-depth and characterize in certain aspects those rings whose non-units are strongly nil-clean in the sense that they are a sum of commuting nilpotent and idempotent. In addition, we examine those rings in which the non-units…
In this article, we introduce the concept of weakly $I$-clean ring, for any ideal $I$ of a ring $R$. We show that, for an ideal $I$ of a ring $R$, $R$ is uniquely weakly $I$-clean if and only if $R/I$ is semi boolean and idempotents can be…
Graphs defined over a finite ring are well-studied in the literature. Due to their nature, these types of graphs connect several branches of mathematics, including algebra, number theory, matrix theory, and representation theory. In recent…
Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…
Gcd-graphs represent an interesting and historically important class of integral graphs. Since the pioneering work of Klotz and Sander, numerous incarnations of these graphs have been explored in the literature. In this article, we define…
A ring R is a strongly 2-nil-clean if every element in R is the sum of two idempotents and a nilpotent that commute. A ring R is feebly clean if every element in R is the sum of two orthogonal idempotents and a unit. In this paper, strongly…
The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph $G$. A graph $G$ is called \emph{perfect} if $\chi(H)=\omega(H)$ for…
In this paper we introduce and study the class of graded U-nil clean rings, as a generalization of graded nil-good class defined in [3]. We also investigate the transfer of the graded U-nil cleaness to matrix rings, and to graded group…
The commuting graph of a non-commutative ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two vertices $x, y$ are adjacent if and only if $xy = yx$. In this paper, we compute the spectrum…
This paper presents an extension of the concept of NR-clean introduced in [12] to graded ring theory. We define and explore graded NR-clean rings, which generalize the class of graded U-nil clean previously studied in [15]. We provide…
We investigate the notion of \textit{semi-nil clean} rings, defined as those rings in which each element can be expressed as a sum of a periodic and a nilpotent element. Among our results, we show that if $R$ is a semi-nil clean NI ring,…
In this paper we study zero--divisor graphs of rings and semirings. We show that all zero--divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
Herzog-Hibi-Hreind\'{o}ttir-Kahle-Rauh introduced the class of closed graph and they proved that the binomial edge ideal $J(G)$ of a graph $G$ has quadratic Gr\"{o}bner bases if $G$ is closed. In this paper, we introduce the class of weakly…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
The notion of clean rings and 2-good rings have many variations, and have been widely studied. We provide a few results about two new variations of these concepts and discuss the theory that ties these variations to objects and properties…