Fractional zero forcing via three-color forcing games

@article{Hogben2016FractionalZF,
  title={Fractional zero forcing via three-color forcing games},
  author={Leslie Hogben and Kevin F. Palmowski and David E. Roberson and Michael Young},
  journal={Discret. Appl. Math.},
  year={2016},
  volume={213},
  pages={114-129}
}

Figures from this paper

Graphs with Extremal Connected Forcing Numbers
TLDR
The results extend existing characterizations of graphs with zero forcing numbers 2 and n-2 and use combinatorial and graph theoretic techniques, in contrast to the linear algebraic approach used to obtain the latter.
The zero forcing polynomial of a graph
Zero forcing and maximum nullity for hypergraphs
Computational Approaches for Zero Forcing and Related Problems
Null Space Strong Structural Controllability via Skew Zero Forcing Sets
TLDR
This paper establishes a one-to-one correspondence between the set of input nodes for null space controllability and the notion of skew zero forcing sets, and provides conditions to guarantee that the null space of the parameterized set of state matrices sharing a common network topology is trivial.
Skew propagation time

References

SHOWING 1-10 OF 23 REFERENCES
Positive semidefinite maximum nullity and zero forcing number
The zero forcing number Z(G) is used to study the minimum rank/maximum nullity of the family of symmetric matrices described by a simple, undirected graph G. The positive semidef- inite zero forcing
Upper bounds on the k-forcing number of a graph
Zero forcing sets and minimum rank of graphs
Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
Fractional minimum positive semidefinite rank is defined from $r$-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive
Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
TLDR
Tree-width, largeur d'arborescence, path- width, and proper path-width are each characterized in terms of a minor monotone floor of a certain zero forcing parameter defined by a color change rule.
Minimum Rank, Maximum Nullity, and Zero Forcing Number of Graphs
This chapter represents an overview of research related to a notion of the “rank of a graph" and the dual concept known as the “nullity of a graph," from the point of view of associating a fixed
Positive semidefinite propagation time
Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
TLDR
The main result says that controllability in the quantum sense, expressed by the Lie algebra rank condition, and controllable in the sense of linear systems, express by the controllabilities matrix rank condition are equivalent conditions.
...
...