The Complexity of the Positive Semidefinite Zero Forcing
DOI10.1007/978-3-319-12691-3_51zbMath1433.05086arXiv1407.7017OpenAlexW310360774MaRDI QIDQ2942442
Karen Meagher, Boting Yang, Shaun M. Fallat
Publication date: 11 September 2015
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.7017
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Fast-mixed searching and related problems on graphs
- Zero forcing parameters and minimum rank problems
- On the fractional intersection number of a graph
- Searching and pebbling
- Positive semidefinite zero forcing
- Zero forcing sets and the minimum rank of graphs
- Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
- On the Fast Searching Problem
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- The complexity of searching a graph
- Monotonicity in graph searching
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
This page was built for publication: The Complexity of the Positive Semidefinite Zero Forcing
