The Cayley Sum Graph of Ideals of a Lattice

Let L be a lattice, 𝒥(L) be the set of ideals of L and S be a subset of 𝒥 (L). In this paper, we introduce an undirected Cayley graph of L, denoted by ΓL,S with elements of 𝒥 (L) as the vertex set and, for two distinct vertices I and J, I is adjacent to J if and only if there is an element K of S such that I ∨ K = J or J ∨ K = I. We study some basic properties of the graph ΓL,S such as connectivity, girth and clique number. Moreover, we investigate the planarity, outerplanarity and ring graph of ΓL,S.