A New Lower Bound for Positive Zero Forcing
From MaRDI portal
Publication:4632220
DOI10.1007/978-3-319-59605-1_23zbMath1492.05097OpenAlexW2616889175MaRDI QIDQ4632220
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
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)
Related Items
Cites Work
- Unnamed Item
- Fast-mixed searching and related problems on graphs
- Lower bounds for positive semidefinite zero forcing and their applications
- Fast edge searching and fast searching on graphs
- Positive semidefinite propagation time
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- Matching theory
- Positive semidefinite zero forcing
- Zero forcing sets and the minimum rank of graphs
- Compressed cliques graphs, clique coverings and positive zero forcing
- Line graphs: Their maximum nullities and zero forcing numbers
- 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
- Positive semidefinite maximum nullity and zero forcing number
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- Hamilton Paths in Grid Graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- On the complexity of the positive semidefinite zero forcing number
