Failed skew zero forcing on a graph
From MaRDI portal
Publication:314747
DOI10.1016/j.laa.2016.07.019zbMath1346.05159OpenAlexW2487063528MaRDI QIDQ314747
Daniel Saavedra, Thomas Ansill, Jaime Penzellna, Bonnie C. Jacob
Publication date: 16 September 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.07.019
perfect matchingpseudographfailed zero forcingminimum skew rankminimum zero diagonal rankskew zero forcing
Related Items (6)
On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ Failed zero forcing and critical sets on directed graphs ⋮ On Grundy total domination number in product graphs ⋮ Failed power domination on graphs ⋮ On the complexity of failed zero forcing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propagation time for zero forcing on a graph
- Minimum rank of skew-symmetric matrices described by a graph
- Zero forcing parameters and minimum rank problems
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- The minimum rank of symmetric matrices described by a graph: a survey
- The failed zero forcing number of a graph
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
- Positive semidefinite zero forcing
- Classes of graphs with minimum skew rank 4
- Zero forcing sets and the minimum rank of graphs
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds
- Nondiscriminatory propagation on trees
- On zero forcing number of graphs and their complements
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- Minimum rank with zero diagonal
- On the complexity of the positive semidefinite zero forcing number
This page was built for publication: Failed skew zero forcing on a graph
