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...

In this paper, we associate a simple graph to a lattice L, in which the vertex

set is being the set of all elements of L, and two distinct vertices x and y are adjacent

if x ∨ y ∈ S, when S is a multiplicatively closed subset of L...

In this paper we introduce the comaximal graph of a finite bounded lattice L,

denoted by G(L). We also study the interplay of lattice-theoretic properties of L with graph theoretic

properties of G(L)....

In this paper we investigate the toroidality of the comaximal graph‎

‎of a finite lattice‎....

We analyze the impact of loss in lattices of coupled optical waveguides and find that, in such a case, the hopping between adjacent waveguides is necessarily complex. This results not only in a transition of the ight spreading from ballistic...