کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
430561 688041 2013 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Lattices, whose incomparability graphs have horns
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Lattices, whose incomparability graphs have horns
چکیده انگلیسی

In this paper, we study some graphs which are realizable and some which are not realizable as the incomparability graph (denoted by Γ′(L)Γ′(L)) of a lattice L   with at least two atoms. We prove that the complete graph KnKn with two horns is realizable as Γ′(L)Γ′(L). We show that the complete graph K3K3 with three horns is not realizable as Γ′(L)Γ′(L), however it is realizable as the zero-divisor graph of L  . Also we give a necessary and sufficient condition for a complete bipartite graph with one horn and with two horns to be realizable as Γ′(L)Γ′(L) for some lattice L.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Discrete Algorithms - Volume 23, November 2013, Pages 63–75
نویسندگان
, ,