Meet-nonessential graph of an Artinian lattice

Let L be a lattice with ۱. The meet-nonessential graph \mathbb{MG} (L) of L is a graph whose vertices are all nonessential filters of L and two distinct filters F and G are adjacent if and only if F \wedge G is a nonessential filter of L. The basic properties and possible structures of the graph \mathbb{MG}(L) are investigated. The clique number, domination number and independence number of \mathbb{MG}(L) and their relations to algebraic properties of L are explored.

کلیدواژه ها:

Essential filter ، Lattice ، Meet-essential graph