Fractional Zero Forcing via Three-color Forcing Games
arXiv:1509.02883 · doi:10.1016/j.dam.2016.05.004
Abstract
An -fold analogue of the positive semidefinite zero forcing process that is carried out on the -blowup of a graph is introduced and used to define the fractional positive semidefinite forcing number. Properties of the graph blowup when colored with a fractional positive semidefinite forcing set are examined and used to define a three-color forcing game that directly computes the fractional positive semidefinite forcing number of a graph. We develop a fractional parameter based on the standard zero forcing process and it is shown that this parameter is exactly the skew zero forcing number with a three-color approach. This approach and an algorithm are used to characterize graphs whose skew zero forcing number equals zero.
arXiv comment24 pages
References in corpus (5)
- Full control by locally induced relaxation
- Propagation time for zero forcing on a graph
- Zero forcing, linear and quantum controllability for systems evolving on networks
- Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
- Upper bounds on the k-forcing number of a graph