A new lower bound for positive zero forcing

DOI10.1007/978-3-319-59605-1_23MaRDI QIDQ4632220zbMATH OpenOpenAlexFDO

Authors Boting Yang

Publication date 26 April 2019

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-59605-1_23

zbMATH Keywords

positive zero forcing numberCartesian product of a cycle and a path

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Positive semidefinite zero forcing numbers of two classes of graphs
• Lower bounds for positive semidefinite zero forcing and their applications
• Positive semidefinite zero forcing: complexity and lower bounds
• Positive semidefinite zero forcing
• The complexity of the positive semidefinite zero forcing

Cites work

• A protocol for cooling and controlling composite systems by local interactions
• Compressed cliques graphs, clique coverings and positive zero forcing
• Fast edge searching and fast searching on graphs
• Fast-mixed searching and related problems on graphs
• Hamilton Paths in Grid Graphs
• Line graphs: their maximum nullities and zero forcing numbers.
• Lower bounds for positive semidefinite zero forcing and their applications
• Matching theory
• 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 minimum rank and zero forcing sets of a graph
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• 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 maximum nullity and zero forcing number
• Positive semidefinite propagation time
• Positive semidefinite zero forcing
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(4)

• Positive semidefinite zero forcing numbers of two classes of graphs
• Upper bounds for positive semidefinite propagation time
• Compressed cliques graphs, clique coverings and positive zero forcing
• On the complexity of the positive semidefinite zero forcing number

This page was built for publication: A new lower bound for positive zero forcing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632220)