$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.
منابع مشابه
$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.
متن کامل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...
متن کاملA generalization of zero-divisor graphs
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
متن کامل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...
متن کاملZero 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...
متن کاملOn bipartite zero-divisor graphs
A (finite or infinite) complete bipartite graph together with some end vertices all adjacent to a common vertex is called a complete bipartite graph with a horn. For any bipartite graph G, we show that G is the graph of a commutative semigroup with 0 if and only if it is one of the following graphs: star graph, two-star graph, complete bipartite graph, complete bipartite graph with a horn. We a...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 2 شماره 1
صفحات 33- 38
تاریخ انتشار 2014-06-30
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023