Related papers: Zero-Divisor Graphs of Quotient Rings

The upper ideal relation graph $\Gamma_{U}(R)$ of a commutative ring $R$ with unity is a simple undirected graph with the set of all non-unit elements of $R$ as a vertex set and two vertices $x$, $y$ are adjacent if and only if the…

Let $R$ be a finite commutative ring with $1\ne 0$. In this article, we study the total graph of $R$, denoted by $\tau (R)$, determine some of its basic graph-theoretical properties, determine when it is Eulerian, and find some conditions…

Let $R\ $be an integral domain and $R^{\#}$ the set of all nonzero nonunits of $R.\ $For every elements $a,b\in R^{\#},$ we define $a\sim b$ if and only if $aR=bR,$ that is, $a$ and $b$ are associated elements. Suppose that $EC(R^{\#})$ is…

A graph $G$ is perfectly divisible if, for every induced subgraph $H$ of $G$, either $V(H)$ is a stable set or admits a partition into two sets $X_1$ and $X_2$ such that $\omega(H[X_1]) < \omega(H)$ and $H[X_2]$ is a perfect graph. In this…

Let $R$ be a commutative ring and ${\Bbb{A}}(R)$ be the set of ideals with non-zero annihilators. The annihilating-ideal graph of $R$ is defined as the graph ${\Bbb{AG}}(R)$ with the vertex set ${\Bbb{A}}(R)^*={\Bbb{A}}\setminus\{(0)\}$ and…

The domination polynomial (the total domination polynomial) of a graph $ G $ of order $ n $ is the generating function of the number of dominating sets (total dominating sets) of $ G $ of any size. In this paper, we study the domination…

We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…

In this note we consider the independent domination polynomial problem along with their unimodal and log-concave properties which were earlier studied by G\"ursoy, \"Ulker and G\"ursoy (Soft Comp. 2022). We show that the independent…

We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…

Unique factorization fails in many rings and monoids, but divisor and transfer homomorphisms provide tools to understand non-unique factorizations. In this expository article, we first explore these notions in the classical setting of…

In this article we prove several important results on graded rings, especially monoid-rings, that are motivated and inspired by Kaplansky's zero-divisor, unit and idempotents conjectures. Among the main results, we first generalize…

This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal…

Let $R$ be a ring with unity. The clean graph $\text{Cl}(R)$ of a ring $R$ is the simple undirected graph whose vertices are of the form $(e,u)$, where $e$ is an idempotent element and $u$ is a unit of the ring $R$ and two vertices $(e,u)$,…

Let $R$ be a commutative ring with unity. The essential ideal graph $\mathcal{E}_{R}$ of $R$ is a graph whose vertex set consists of all nonzero proper ideals of \textit{R}. Two vertices $\hat{I}$ and $\hat{J}$ are adjacent if and only if…

Recently substantial progress has been made on generalized factorization techniques in integral domains, in particular $\tau$-factorization. There has also been advances made in investigating factorization in commutative rings with…

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…

In this paper we show that if $I$ is an ideal of a commutative semigroup $C$ such that the separator $SepI$ of $I$ is not empty then the factor semigroup $S=C/P_I$ ($P_I$ is the principal congruence on $C$ defined by $I$) satisfies…

Let $R$ be a ring with unity. The non-zero divisor graph of $R$, $\Phi(R)$, is the graph with vertex set $R\backslash \{0,1,-1\}$, and two vertices $x$ and $y$ are adjacent if and only if either $xy$ or $yx$ is non-zero. In this article we…

We call a set $\mathcal S$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\mathcal…

A non-zero component graph $G(\mathbb{V})$ associated to a finite vector space $\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one…