Lower bounds for positive semidefinite zero forcing and their applications
DOI10.1007/S10878-015-9936-0zbMATH Open1364.05040OpenAlexW1061820890MaRDI QIDQ512866FDOQ512866
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9936-0
Recommendations
- Positive semidefinite zero forcing: complexity and lower bounds
- On the complexity of the positive semidefinite zero forcing number
- The complexity of the positive semidefinite zero forcing
- Positive semidefinite zero forcing numbers of two classes of graphs
- Zero forcing parameters and minimum rank problems
minimum rankzero forcing numbermaximum positive semidefinite nullitypositive semidefinite zero forcing numbertree cover number
Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex degrees (05C07)
Cites Work
- Zero forcing sets and the minimum rank of graphs
- Searching and pebbling
- The complexity of searching a graph
- Graph minors. I. Excluding a forest
- Monotonicity in graph searching
- Strong-mixed searching and pathwidth
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Graph minors. III. Planar tree-width
- Zero forcing parameters and minimum rank problems
- Positive semidefinite zero forcing
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- On the complexity of the positive semidefinite zero forcing number
- Topology of series-parallel networks
- On the Fast Searching Problem
- Fast-mixed searching and related problems on graphs
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- On the complexity of bicoloring clique hypergraphs of graphs
- Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
Cited In (7)
- Positive semidefinite zero forcing numbers of two classes of graphs
- Compressed cliques graphs, clique coverings and positive zero forcing
- Positive Zero Forcing and Edge Clique Coverings
- On the complexity of the positive semidefinite zero forcing number
- A New Lower Bound for Positive Zero Forcing
- Restricted power domination and zero forcing problems
- An integer program for positive semidefinite zero forcing in graphs
This page was built for publication: Lower bounds for positive semidefinite zero forcing and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512866)
