An integer program for positive semidefinite zero forcing in graphs
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (DMS‐1720225)
This publication has 28 references indexed in Scilit:
- Computational approaches for zero forcing and related problemsEuropean Journal of Operational Research, 2019
- Throttling positive semidefinite zero forcing propagation time on graphsDiscrete Applied Mathematics, 2019
- Zero forcing propagation time on oriented graphsDiscrete Applied Mathematics, 2017
- Using variants of zero forcing to bound the inertia set of a graphThe Electronic Journal of Linear Algebra, 2015
- Minimum semidefinite rank of outerplanar graphs and the tree cover numberThe Electronic Journal of Linear Algebra, 2011
- Zero forcing parameters and minimum rank problemsLinear Algebra and its Applications, 2010
- Zero forcing sets and the minimum rank of graphsLinear Algebra and its Applications, 2008
- Full Control by Locally Induced RelaxationPhysical Review Letters, 2007
- On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}Mathematical Programming, 1989
- Graph Theory with Applications1976