Delbrin Ahmed

collaborators

2 papers

math.CO2024

Analyzing Subuniverse Counts in Finite Semilattices: Unveiling the Rankings and Descriptions

Delbrin Ahmed, Muwafaq Salih, Dilbak Haje

Let $(L, \lor)$ be a finite n-element semilattice where $n \geq 5$ . We prove that the fourth largest number of subuniverses of an $n$ -element semilattice is $25 \cdot 2^{n - 5}$ , 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 $G = (V, E)$ be a finite connected simple graph with vertex set $V$ and edge set $E$ . A signed Roman dominating function (SRDF) on a graph $G$ is a function $f: V \rightarrow \{-1…