Lower bounds for positive semidefinite zero forcing and their applications

DOI10.1007/S10878-015-9936-0MaRDI QIDQ512866zbMATH OpenOpenAlexFDO

Authors Boting Yang

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

zbMATH Keywords

minimum rankzero forcing numbermaximum positive semidefinite nullitypositive semidefinite zero forcing numbertree cover number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex degrees (05C07)

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

Cites work

• Fast-mixed searching and related problems on graphs
• Graph minors. I. Excluding a forest
• Graph minors. III. Planar tree-width
• Minimum semidefinite rank of outerplanar graphs and the tree cover number
• Monotonicity in graph searching
• 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
• On the complexity of bicoloring clique hypergraphs of graphs
• On the complexity of the positive semidefinite zero forcing number
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Positive semidefinite zero forcing
• Searching and pebbling
• Strong-mixed searching and pathwidth
• The complexity of searching a graph
• Topology of series-parallel networks
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(11)

• An integer program for positive semidefinite zero forcing in graphs
• Positive zero forcing and edge clique coverings
• Positive semidefinite zero forcing numbers of two classes of graphs
• Compressed cliques graphs, clique coverings and positive zero forcing
• Computational approaches for zero forcing and related problems
• On the complexity of the positive semidefinite zero forcing number
• The complexity of the positive semidefinite zero forcing
• A New Lower Bound for Positive Zero Forcing
• Restricted power domination and zero forcing problems
• Positive semidefinite zero forcing: complexity and lower bounds
• Induced trees, minimum semidefinite rank, and zero forcing

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)