A GRAPH ASSOCIATED TO FILTERS OF A LATTICE
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...
Збережено в:
| Автори: | , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Shahrood University of Technology
2023-01-01
|
| Серія: | Journal of Algebraic Systems |
| Предмети: | |
| Онлайн доступ: | https://jas.shahroodut.ac.ir/article_2479_32018ff0f5780e323702b204f0d79d44.pdf |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|