Dual digraphs of finite semidistributive lattices
Dual digraphs of finite join-semidistributive lattices, meet-semidistributive lattices and semidistributive lattices are characterised. The vertices of the dual digraphs are maximal disjoint filter-ideal pairs of the lattice. The approach used here combines representations of arbitrary lattices due...
Main Authors: | Andrew Craig, Miroslav Haviar, José São João |
---|---|
Format: | Article |
Language: | English |
Published: |
Universidad de La Frontera
2022-12-01
|
Series: | Cubo |
Subjects: | |
Online Access: | https://cubo.ufro.cl/ojs/index.php/cubo/article/view/3205/2256 |
Similar Items
-
Congruences of finite semidistributive lattices
by: J. B. Nation
Published: (2024-12-01) -
Dual digraphs of finite meet-distributive and modular lattices
by: Andrew Craig, et al.
Published: (2024-08-01) -
Efficient Open Domination in Digraph Products
by: Dragana Božović, et al.
Published: (2020-04-01) -
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
by: Hernández-Cruz César
Published: (2013-05-01) -
(K − 1)-Kernels In Strong K-Transitive Digraphs
by: Wang Ruixia
Published: (2015-05-01)