A generalization of zero-divisor graphs
author
Abstract:
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
similar resources
On zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
full text$C_4$-free zero-divisor graphs
In this paper we give a characterization for all commutative rings with $1$ whose zero-divisor graphs are $C_4$-free.
full texton zero-divisor graphs of quotient rings and complemented zero-divisor graphs
for an arbitrary ring $r$, the zero-divisor graph of $r$, denoted by $gamma (r)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $r$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. it is well-known that for any commutative ring $r$, $gamma (r) cong gamma (t(r))$ where $t(r)$ is the (total) quotient ring of $r$. in this...
full textZero Divisor Graphs of Posets
In 1988, Beck [10] introduced the notion of coloring of a commutative ring R. Let G be a simple graph whose vertices are the elements of R and two vertices x and y are adjacent if xy = 0. The graph G is known as the zero divisor graph of R. He conjectured that, the chromatic number χ(G) of G is same as the clique number ω(G) of G. In 1993, Anderson and Naseer [1] gave an example of a commutativ...
full textOn quasi-zero divisor graphs of non-commutative rings
Let $R$ be an associative ring with identity. A ring $R$ is called reversible if $ab=0$, then $ba=0$ for $a,bin R$. The quasi-zero-divisor graph of $R$, denoted by $Gamma^*(R)$ is an undirected graph with all nonzero zero-divisors of $R$ as vertex set and two distinct vertices $x$ and $y$ are adjacent if and only if there exists $0neq rin R setminus (mathrm{ann}(x) cup mathrm{ann}(y))$ such tha...
full text$c_4$-free zero-divisor graphs
in this paper we give a characterization for all commutative rings with $1$ whose zero-divisor graphs are $c_4$-free.
full textMy Resources
Journal title
volume 51 issue 2
pages 35- 45
publication date 2019-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023