Showing math.COShow all
3 papers · 1 filter
math.CO2024
Analyzing Subuniverse Counts in Finite Semilattices: Unveiling the Rankings and Descriptions
Delbrin Ahmed, Muwafaq Salih, Dilbak Haje
Let be a finite n-element semilattice where . We prove that the fourth largest number of subuniverses of an -element semilattice is , the fi…
math.CO2024
The Signed Roman Domination Number of Ladder graphs, circular Ladder graphs and their complements
Dilbak Haje, Delbrin Ahmed, Hassan Izanloo +1
Let be a finite connected simple graph with vertex set and edge set . A signed Roman dominating function (SRDF) on a graph is a function $f: V \rightarrow \{-1…
math.CO2021
(1+1+2)-generated lattices of quasiorders
Delbrin Ahmed, Gábor Czédli
A lattice is -generated if it has a four-element generating set such that exactly two of the four generators are comparable. We prove that the lattice Quo of all quas…