|
|
a graph associated to filters of a lattice
|
|
|
|
|
نویسنده
|
ebrahimi atani sh. ,khoramdel m. ,dolati pish hesari s. ,nikmard rostamalipour m.
|
منبع
|
journal of algebraic systems - 2023 - دوره : 10 - شماره : 2 - صفحه:345 -359
|
چکیده
|
Let l be a lattice with the least element 0 and thegreatest element 1. in this paper, we associate a graph to filters of l, in which the vertex set is being the set of all non-trivial filters of l, and two distinct vertices f and e are adjacent if and only if f ∩ e ̸= {1}. we denote this graph by g(l). the basic properties and possible structures of g (l) are studied. moreover, we characterize the planarity of g (l).
|
کلیدواژه
|
lattice ,filter ,intersection graph
|
آدرس
|
university of guilan, department of mathematics, iran, university of guilan, department of mathematics, iran, university of guilan, department of mathematics, iran, university of guilan, department of mathematics, iran
|
پست الکترونیکی
|
mhs.nikmard@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|