Let L be a multiplicative lattice and M be a lattice module over L. In this paper, we assign a graph to M called residual division graph RG(M) in which the element N ∈ M is a vertex if there exists 0M ≠ P ∈ M such that NP = 0M and two vertices N1, N2 are adjacent if N1N2 = 0M (where N1N2 = (N1 : IM)(N2 : IM)IM). It is proved that such a graph with the greatest element IM which does not belong to the vertex set is nonempty if and only if M is a prime lattice module. Also, we provide conditions such that RG(M) is isomorphic to a subgraph of Zariski topology graph ĢX(M) with respect to X.
Read full abstract