Zero forcing and maximum nullity for hypergraphs
From MaRDI portal
Publication:2185737
DOI10.1016/j.dam.2019.11.019zbMath1441.05166arXiv1808.09908MaRDI QIDQ2185737
Publication date: 5 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.09908
05C65: Hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
A zero forcing technique for bounding sums of eigenvalue multiplicities, Uniform forcing and immune sets in graphs and hypergraphs, Infectious power domination of hypergraphs
Cites Work
- Unnamed Item
- Fractional zero forcing via three-color forcing games
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- On the \({k}\)-power domination of hypergraphs
- Minimum rank of skew-symmetric matrices described by a graph
- The minimum rank of symmetric matrices described by a graph: a survey
- Infection in hypergraphs
- Hypergraph theory. An introduction
- Zero forcing sets and the minimum rank of graphs
- Domination in Graphs Applied to Electric Power Networks
- Minimum rank with zero diagonal