Positive semidefinite zero forcing numbers of two classes of graphs
DOI10.1016/J.TCS.2018.05.009zbMATH Open1432.05064OpenAlexW2801804049WikidataQ129871386 ScholiaQ129871386MaRDI QIDQ2319902FDOQ2319902
Authors: Lusheng Wang, Boting Yang 
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
Recommendations
minimum rankzero forcing numbermaximum positive semidefinite nullitypositive semidefinite zero forcing number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Matching theory
- Zero forcing sets and the minimum rank of graphs
- Hamilton Paths in Grid Graphs
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Graph minors. III. Planar tree-width
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- Positive semidefinite zero forcing
- Positive semidefinite maximum nullity and zero forcing number
- Nondiscriminatory propagation on trees
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- A technique for computing the zero forcing number of a graph with a cut-vertex
- On the complexity of the positive semidefinite zero forcing number
- Positive semidefinite propagation time
- Bounds for minimum semidefinite rank from superpositions and cutsets
- Linearly independent vertices and minimum semidefinite rank
- On the Fast Searching Problem
- Fast-mixed searching and related problems on graphs
- Fast edge searching and fast searching on 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
- Lower bounds for positive semidefinite zero forcing and their applications
- A new lower bound for the positive semidefinite minimum rank of a graph
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Compressed cliques graphs, clique coverings and positive zero forcing
- Line graphs: their maximum nullities and zero forcing numbers.
Cited In (9)
- Propagation tree decompositions and linearly independent vertices
- Blocking zero forcing processes in Cartesian products of graphs
- Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
- On the complexity of the positive semidefinite zero forcing number
- On the zero blocking number of rectangular, cylindrical, and Möbius grids
- The complexity of the positive semidefinite zero forcing
- Positive semidefinite zero forcing: complexity and lower bounds
- Lower bounds for positive semidefinite zero forcing and their applications
- Positive semidefinite zero forcing
This page was built for publication: Positive semidefinite zero forcing numbers of two classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319902)
