Infection in hypergraphs
From MaRDI portal
Publication:1701092
DOI10.1016/j.dam.2017.11.012zbMath1380.05139arXiv1607.08641OpenAlexW2964023068MaRDI QIDQ1701092
Ryan Bergen, Ferdinand Ihringer, Adam Gorr, Boting Yang, Karen Meagher, Guanglong Yu, Alison Purdy, Shaun M. Fallat
Publication date: 22 February 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.08641
Related Items (4)
Zero forcing and maximum nullity for hypergraphs ⋮ Uniform forcing and immune sets in graphs and hypergraphs ⋮ Infectious power domination of hypergraphs ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs
Cites Work
- Unnamed Item
- Fast-mixed searching and related problems on graphs
- Propagation time for zero forcing on a graph
- Upper bounds on the \(k\)-forcing number of a graph
- Transversals and domination in uniform hypergraphs
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- The minimum rank of symmetric matrices described by a graph: a survey
- Interval hypergraphs and D-interval hypergraphs
- Zero forcing sets and the minimum rank of graphs
- Iteration Index of a Zero Forcing Set in a Graph
- Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
- Nondiscriminatory propagation on trees
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Probabilistic Zero Forcing in Graphs
This page was built for publication: Infection in hypergraphs