Showing 2025Show all
3 papers · 1 filter
math.CO2025
On the minimal forts of trees
Thomas R. Cameron, Kelvin Li
In 2018, the concept of a fort in graph theory was introduced as a non-empty subset of vertices satisfying the condition that no vertex outside the set has exactly one neighbor in…
math.CO2025
IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
Thomas R. Cameron, Jonad Pulaj
Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero for…
math.CO2025
On the forts and related parameters of the hypercube graph
Boris Brimkov, Thomas R. Cameron, Owen Grubbs
In 2018, forts were defined as non-empty subsets of vertices in a graph where no vertex outside the set has exactly one neighbor in the set. Forts have since been used to character…