نتایج جستجو برای: zero divisor graph

تعداد نتایج: 343463  

Journal: :transactions on combinatorics 2014
torsten sander khalida mohammad nazzal

let $r$ be a commutative ring with zero-divisor set $z(r)$. the total graph of $r$, denoted by$t(gamma(r))$, is the simple (undirected) graph with vertex set  $r$ where two distinct vertices areadjacent if their sum lies in $z(r)$.this work considers minimum zero-sum $k$-flows for $t(gamma(r))$.both for $vert rvert$ even and the case when $vert rvert$ is odd and $z(g)$ is an ideal of $r$it is s...

2003
Hamid Reza Maimani Shahid Rajaee H. R. Maimani

For a commutative semigroup S with 0, the zero-divisor graph of S denoted by Γ(S) is the graph whose vertices are nonzero zero-divisor of S, and two vertices x, y are adjacent in case xy = 0 in S. In this paper we study median and center of this graph. Also we show that if Ass(S) has more than two elements, then the girth of Γ(S) is three.

2009
Shahabaddin Ebrahimi Atani S. P. Redmond S. EBRAHIMI ATANI

There is a natural graph associated to the zero-divisors of a commutative semiring with non-zero identity. In this article we essentially study zero-divisor graphs with respect to primal and non-primal ideals of a commutative semiring R and investigate the interplay between the semiring-theoretic properties of R and the graph-theoretic properties of ΓI(R) for some ideal I of R. We also show tha...

Journal: :Publications de l'Institut Mathematique 2019

Journal: :TURKISH JOURNAL OF MATHEMATICS 2016

2013
Mojgan Afkhami Kazem Khashyarmanesh

Let R be a commutative ring with non-zero identity. The cozero-divisor graph of R, denoted by , is a graph with vertices in   R     W R  , which is the set of all non-zero and non-unit elements of R, and two distinct vertices a and b in are adjacent if and only if and   W R  a bR  b aR  . In this paper, we investigate some combinatorial properties of the cozero-divisor graphs    ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید