شماره ركورد كنفرانس :
3806
عنوان مقاله :
The Realizability of a Graph Associated to a Lattice
پديدآورندگان :
Malekpour S. Malekpoor@grad.kashanu.ac.ir University of Kashan , Bazigaran B. Department of Mathematics, University of Kashan, Kashan, Iran
كليدواژه :
Prime filter , split graph , k , partite graph
عنوان كنفرانس :
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
چكيده فارسي :
Suppose that L is a finite lattice and S is a ∧-closed subset of L. The graph ΓS(L) is a graph with all elements of L as vertices and two distinct vertices x,y ∈ L are adjacent if and only if x∨y ∈ S. In this paper, we discuss the realizability of ΓS(L), for some graphs.
