Infection in hypergraphs
From MaRDI portal
Publication:1701092
DOI10.1016/J.DAM.2017.11.012zbMATH Open1380.05139arXiv1607.08641OpenAlexW2964023068MaRDI QIDQ1701092FDOQ1701092
Ryan Bergen, Ferdinand Ihringer, Adam Gorr, Shaun M. Fallat, Boting Yang, K. Meagher, Guanglong Yu, Alison Purdy
Publication date: 22 February 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: In this paper a new parameter for hypergraphs called hypergraph infection is defined. This concept generalizes zero forcing in graphs to hypergraphs. The exact value of the infection number of complete and complete bipartite hypergraphs is determined. A formula for the infection number for interval hypergraphs and several families of cyclic hypergraphs is given. The value of the infection number for a hypergraph whose edges form a symmetric t-design is given, and bounds are determined for a hypergraph whose edges are a t-design. Finally, the infection number for several hypergraph products and line graphs are considered.
Full work available at URL: https://arxiv.org/abs/1607.08641
Recommendations
- On infection in hypergraphs
- Infectious power domination of hypergraphs
- The infection time of graphs
- scientific article; zbMATH DE number 5931630
- Infection spread in random geometric graphs
- Distinguishing Infections on Different Graph Topologies
- SIS epidemic propagation on hypergraphs
- SIS epidemic propagation on hypergraphs
- Contagion in graphons
- Spread of infection over P.A. random graphs with edge insertion
Cites Work
- Zero forcing sets and the minimum rank of graphs
- The CRC handbook of combinatorial designs
- Transversals and domination in uniform hypergraphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- 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
- Propagation time for zero forcing on a graph
- Upper bounds on the \(k\)-forcing number of a graph
- The minimum rank of symmetric matrices described by a graph: a survey
- Fast-mixed searching and related problems on graphs
- Interval hypergraphs and D-interval hypergraphs
- Probabilistic Zero Forcing in Graphs
Cited In (7)
- Zero forcing and maximum nullity for hypergraphs
- Infectious power domination of hypergraphs
- Permutation Tests for Infection Graphs
- Uniform forcing and immune sets in graphs and hypergraphs
- Title not available (Why is that?)
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- The infection time of graphs
This page was built for publication: Infection in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701092)
