Related papers: Nil clean graph of rings

The zero-divisor graph $\Gamma(R)$ of an associative ring $R$ is the graph whose vertices are all nonzero zero-divisors (one-sided and two-sided) of $R$, and two distinct vertices $x$ and $y$ are joined by an edge iff either $xy=0$ or…

An element in a ring $R$ is called clear if it is the sum of unit-regular element and unit. An associative ring is clear if every its element is clear. In this paper we defined clear rings and extended many results to wider class. Finally,…

The annihilator graph $AG(R)$ of the commutative ring $R$ is an undirected graph with vertex set as the set of all non-zero zero divisors of $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $ann(xy) \neq ann(x) \cup…

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…

Let R be a ring with the set of nilpotents Nil(R). We prove that the following are equivalent: (i) Nil(R) is additively closed, (ii) Nil(R) is multiplicatively closed and R satisfies Koethe's conjecture, (iii) Nil(R) is closed under the…

For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, we characterize all graphs with connected…

Let R be a commutative ring with identity. In this paper, we introduce and investigate the second ideal intersection graph SII(R) of R with vertices are non-zero proper ideals of R and two distinct vertices I and J are adjacent if and only…

The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We characterize the finite nilpotent groups whose power graphs have…

A ring is called clean if every element is the sum of an invertible element and an idempotent. This paper investigates the cleanness of AW*-algebras. We prove that all finite AW*-algebras are clean, affirmatively solving a question posed by…

Let $R$ be a commutative ring with nonzero identity and $I$ a proper ideal of $R$. The {\it ideal-based zero-divisor graph} of $R$ with respect to the ideal $I$, denoted by $\Gamma_I(R)$, is the graph on vertices $\{x \in R\setminus I \mid…

The paper is devoted to studying the orthogonality graph of the matrix ring over a commutative ring. It is proved that the orthogonality graph of the ring of matrices with size greater than 1 over a commutative ring with zero-divisors is…

A ring $R$ is called clean if every element of $R$ is the sum of a unit and an idempotent. Motivated by a question proposed by Lam on the cleanness of von Neumann Algebras, Va\v{s} introduced a more natural concept of cleanness for…

The intersection graph of ideals associated with a commutative unitary ring $R$ is the graph $G(R)$ whose vertices all non-trivial ideals of $R$ and there exists an edge between distinct vertices if and only if the intersection of them is…

An element $a$ of a ring $R$ is called perfectly clean if there exists an idempotent $e\in comm^2(a)$ such that $a-e\in U(R)$. A ring $R$ is perfectly clean in case every element in $R$ is perfectly clean. In this paper, we investigate…

For an artinian ring $R$, the directed zero-divisor graph $\Gamma(R)$ is connected if and only if there is no proper one-sided identity element in $R$. Sinks and sources are characterized and clarified for finite ring $R$, especially, it is…

Let $R$ be a noncommutative ring with identity. The commuting graph of $R$, denoted by $\Gamma(R)$, is a graph with vertex set $R \setminus Z(R)$, and two vertices $a$, $b$ are adjacent if $a\neq b$ and $ab=ba$. Let $T=Tr(R)$ be the ring of…

The core vertex set of a graph is an invariant of the graph. It consists of those vertices associated with the non-zero entries of the nullspace vectors of a $\{0,1\}$-adjacency matrix. The remaining vertices of the graph form the…

A mixed graph is a graph with undirected and directed edges. Guo and Mohar in 2017 determined all mixed graphs whose Hermitian spectral radii are less than $2$. In this paper, we give a sufficient condition which can make Hermitian spectral…

The target of the present work is to give a new insight in the theory of {\it strongly weakly nil-clean} rings, recently defined by Kosan and Zhou in the Front. Math. China (2016) and further explored in detail by Chen-Sheibani in the J.…

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…