Lower bounds for positive semidefinite zero forcing and their applications
From MaRDI portal
Publication:512866
DOI10.1007/s10878-015-9936-0zbMath1364.05040OpenAlexW1061820890MaRDI QIDQ512866
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
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)
Related Items (6)
Compressed cliques graphs, clique coverings and positive zero forcing ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Restricted power domination and zero forcing problems ⋮ Positive Zero Forcing and Edge Clique Coverings ⋮ A New Lower Bound for Positive Zero Forcing ⋮ Positive semidefinite zero forcing numbers of two classes of graphs
Cites Work
- Fast-mixed searching and related problems on graphs
- Graph minors. III. Planar tree-width
- Strong-mixed searching and pathwidth
- Zero forcing parameters and minimum rank problems
- Graph minors. I. Excluding a forest
- Searching and pebbling
- Topology of series-parallel networks
- Positive semidefinite zero forcing
- Zero forcing sets and the minimum rank of graphs
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- 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
- On the complexity of bicoloring clique hypergraphs of graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- On the complexity of the positive semidefinite zero forcing number
This page was built for publication: Lower bounds for positive semidefinite zero forcing and their applications
