相关论文: Strong Resolving Graphs of Clean Graphs of Commuta…

Let R be a ring (not necessarily commutative ring) with identity. The clean graph Cl(R) of a ring R is a graph with vertices in the form of ordered pair (e; u), where e is an idempotent of the ring R and u is a unit of the ring R. Two…

Let $R$ be a ring (not necessarily a commutative ring) with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph with vertices in the form of an ordered pair $(e,u)$, where $e$ is an idempotent and $u$ is a unit of ring $R$,…

Let $R$ be a finite ring with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph whose vertices are pairs $(e, u)$, where $e$ is an idempotent element and $u$ is a unit of $R$. Two distinct vertices $(e, u)$ and $(f, v)$ are…

Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The…

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…

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…

Let $R$ be a commutative ring with identity. The co-maximal ideal graph of $R$, denoted by $\Gamma(R)$, is a simple graph whose vertices are proper ideals of $R$ which are not contained in the Jacobson radical of $R$ and two distinct…

Let $R$ be a commutative ring with unity. The prime ideal sum graph of the ring $R$ is the simple undirected graph whose vertex set is the set of all nonzero proper ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and…

A ring $R$ is called strongly clean if every element of $R$ is the sum of a unit and an idempotent that commute. By {\rm SRC} factorization, Borooah, Diesl, and Dorsey \cite{BDD051} completely determined when ${\mathbb M}_n(R)$ over a…

In this article, we introduce a new graph theoretic structure associated with a finite commutative ring, called nil clean divisor graph. For a ring $R$, nil clean divisor graph is denoted by $G_N(R)$, where the vertex set is $\{x\in R\,:\,…

Let $R$ be a ring (not necessary commutative) with non-zero identity. The unit graph of $R$, denoted by $G(R)$, is a graph with elements of $R$ as its vertices and two distinct vertices $a$ and $b$ are adjacent if and only if $a+b$ is a…

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…

In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set,…

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…

An element $a\in R$ is provided that there exists an idempotent $e\in R$ such that $a-e\in U(R), ae=ea$ and $eae\in J(eRe)$. In this article, we investigate strongly rad-clean matrices over a commutative local ring. We completely determine…

A ring $R$ is uniquely (strongly) clean provided that for any $a\in R$ there exists a unique idempotent $e\in R \big(\in comm(a)\big)$ such that $a-e\in U(R)$. Let $R$ be a uniquely bleached ring. We prove, in this note, that $R$ is…

Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The…

Let $G = (V, E)$ be a graph with the vertex set $V (G)$ and edge set $E(G)$. The Sombor index of $G$, $SO(G)$, is defined as $\sum_{uv\in E(G)} \sqrt{deg(u)^2 + deg(v)^2}$, where $deg(u)$ is the degree of vertex $u$ in $V (G)$. The clean…

Two vertices $u$ and $v$ of an undirected graph $G$ are strongly resolved by a vertex $w$ if there is a shortest path between $w$ and $u$ containing $v$ or a shortest path between $w$ and $v$ containing $u$. A vertex set $R$ is a strong…

An element $x \in R$ is considered (strongly) nil-clean if it can be expressed as the sum of an idempotent $e \in R$ and a nilpotent $b \in R$ (where $eb = be$). If for any $x \in R$, there exists a unit $u \in R$ such that $ux$ is…