The maximum number of minimal forts on a tree on n vertices is at most binom(n,2) times the number on the path on n vertices.
Hybrid search for the optimal P M U placement problem on a power grid
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Number of Zero Forcing Minimal Forts on Trees
The maximum number of minimal forts on a tree on n vertices is at most binom(n,2) times the number on the path on n vertices.