Positive semidefinite zero forcing numbers of two classes of graphs
From MaRDI portal
Publication:2319902
DOI10.1016/j.tcs.2018.05.009zbMath1432.05064MaRDI QIDQ2319902
Publication date: 20 August 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.05.009
minimum rank; zero forcing number; maximum positive semidefinite nullity; positive semidefinite zero forcing number
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
05C76: Graph operations (line graphs, products, etc.)
Related Items
On the zero blocking number of rectangular, cylindrical, and Möbius grids, Blocking zero forcing processes in Cartesian products of graphs, Propagation tree decompositions and linearly independent vertices
Cites Work
- Bounds for minimum semidefinite rank from superpositions and cutsets
- Fast-mixed searching and related problems on graphs
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Lower bounds for positive semidefinite zero forcing and their applications
- Fast edge searching and fast searching on graphs
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Graph minors. III. Planar tree-width
- Linearly independent vertices and minimum semidefinite rank
- Positive semidefinite propagation time
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- Matching theory
- A new lower bound for the positive semidefinite minimum rank of a graph
- 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 Fast Searching Problem
- Nondiscriminatory propagation on trees
- 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
