5 papers · 1 filter
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…
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…
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…
On the number of minimal forts of a graph
Paul Becker, Thomas R. Cameron, Derek Hanely +2
In 2018, a fort of a graph was introduced as a non-empty subset of vertices in which no vertex outside of the set has exactly one neighbor in the set. Since then, forts have been u…
Forts, (fractional) zero forcing, and Cartesian products of graphs
Thomas R. Cameron, Leslie Hogben, Franklin H. J. Kenter +2
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is…