A GRAPH ASSOCIATED TO FILTERS OF A LATTICE
نویسندگان
1 Department of Mathematics, University of Guilan, P.O. Box 1914, Rasht, Iran.
2 Department of Mathematics, University of Guilan, P.O. Box 1914, Rasht, Iran.
3 Department of Mathematics, University of Guilan, P.O. Box 1914, Rasht, Iran.
4 Department of Mathematics, University of Guilan, P.O. Box 1914, Rasht, Iran.
doi
10.22044/jas.2022.10633.1526چکیده
Let $L$ be a lattice with the least element $0$ and the greatest 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 \cap E \neq \{1\}$. We denote this graph by $\mathcal{G}$ $(L)$. The basic properties and possible structures of $\mathcal{G}$ $(L)$ are studied. Moreover, we characterize the planarity of $\mathcal{G}$ $(L)$.
