The intersection graph of ideals of a poset

Abstract

Let (P, ≤) be a partially ordered set (poset, briefly) with a least element 0. The intersection graph of ideal of P , denoted by G(P ), is a graph whose vertices are all non-trivial ideals of P and two distinct vertices I and J are adjacent if and only if I ∩ J = {0}.In this paper, we study some relations between the algebraic properties of posets and graph-theoretic properties of G(P ). We investigate the connectivity, diameter, girth and planarity of the intersection graph. Also, among the other things, we show that if the clique number of G(P ) is finite, then P is finite too.

Characterization of Graphs Associated with the Ideal of Numerical Semigroups

“…is idea explores the interaction between structures of algebraic objects and graphs by using properties of graphs and algebraic structures. In the past, many researchers associated graphs with different algebraic structures (see [4][5][6][7][8][9][10][11]).…”

On Graphs of Bounded Semilattices

“…On the other hand, the intersection graphs of substructures of an algebraic structure have been investigated by many authors [1,5,8,12,22,23,29,30]. Our original motivation for this work was the intersection graphs of submodules of a module [2] and our discussions on this topic led us to work on a more general context, i.e.…”

Classification of Planar Graphs Associated to the Ideal of the Numerical Semigroup

“…This lead to many interesting results and questions. There are many papers on assigning graphs to rings, groups and semigroups see [1,2,3,4,5,6]. Several authors [7,8,9,10,11] studied different properties of these graphs including diameter, girth, domination, central sets and planarity.…”