2 problems

Let $G$ be a graph of order $n$, and let $\mathcal{F}_G$ denote the family of minimal forts of $G$. Minimal-forts lower-bound conjecture. The number of minimal forts satisfies … Th…

Let $G$ be a graph, let $n$ be its order, and let $\mathcal{F}_G$ denote the family of minimal forts of $G$. Let $\operatorname{Z}(G)$ denote the zero forcing number of $G$. Zero-f…