An ideal-based graph of a bounded lattice

Abstract

Let [Formula: see text] be a lattice, [Formula: see text] an ideal of [Formula: see text] and [Formula: see text] the set of all elements of [Formula: see text] which are not prime to [Formula: see text]. In this paper, we investigate some interesting properties of [Formula: see text] and introduce the total graph of a lattice [Formula: see text] with respect to an ideal [Formula: see text]. It is the graph with all elements of [Formula: see text] as vertices and for distinct [Formula: see text], the vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. We investigated the basic properties of this graph and its induced subgraphs as diameter, girth, clique number, cut vertex and independence number.