On the inclusion ideal graph of a poset

Abstract

Let (P, 6) be an atomic partially ordered set (poset, briefly) with a minimum element 0 and I(P) the set of nontrivial ideals of P. The inclusion ideal graph of P, denoted by Ω(P), is an undirected and simple graph with the vertex set I(P) and two distinct vertices I, J ∈ I(P) are adjacent in Ω(P) if and only if I ⊂ J or J ⊂ I. We study some connections between the graph theoretic properties of this graph and some algebraic properties of a poset. We prove that Ω(P) is not connected if and only if P = {0, a1, a2}, where a1, a2 are two atoms. Moreover, it is shown that if Ω(P) is connected, then diam(Ω(P)) 6 3. Also, we show that if Ω(P) contains a cycle, then girth(Ω(P)) ∈ {3, 6}. Furthermore, all posets based on their diameters and girths of inclusion ideal graphs are characterized. Among other results, all posets whose inclusion ideal graphs are path, cycle and star are characterized.