In this talk we study the pannerity of zero divisor graph of partially ordered sets...

In this talk we introduce the cozero divisor graph which is adual of zero divisor graph and we study some properties of this graph....

For a finite bounded lattice pounds , we associate a zero-divisor graph G( pounds) which is a natural generalization of the concept of zero-divisor graph for a Boolean algebra. Also, we study the interplay of lattice-theoretic properties...

For a finite bounded lattice £, we associate a zero-divisor graph

G(£) which is a natural generalization of the concept of zero-divisor graph

for a Boolean algebra. Also, we study the interplay of lattice...

Gamma\\\\\\'(R), which is a dual of zero-divisor graph Gamma(R) in some sense, as the (undirected) graph with vertices W^*(R)

and for two distinct elements x and y in W^*(R), the

vertices x and y are adjacent if and only if x not in R

and y not in x...

In this paper, for a bounded lattice L and an ideal I of L, we introduce the

zero-divisor graph of L with respect to I , denoted by T-I (L). We study the interplay

of lattice-theoretic properties of L with graph-theoretic properties...

In this talk we study Ring graphs and ‎outerplanar‎ graphs for zero divisor graphs and unite and unitary graphs....

In this paper we determine the cut vertices in the zero-divisor graphs of posets. Also we investigate some properties of zero-divisor graph of the product of two posets....

The zero divisor graph of a partially ordered set (poset, briefly) with the least element 0 wich is denoted by G^*(P) is an undirected graph with vertex set P^*=P-{0} and for two distinct vertices x and y, x is adjacent to y in G^*(P) if and only...

transpose of B. If n = 1, then T^n_R is isomorphic to the zero divisor

graph T(R), and so T^n_R is a generalization of T(R) which is called a generalized

zero divisor graph of R. In this paper, we study some basic properties of T...