Infection in hypergraphs
From MaRDI portal
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.
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
- Fast-mixed searching and related problems on graphs
- Interval hypergraphs and D-interval hypergraphs
- 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
- On minimum rank and zero forcing sets of a graph
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Probalistic zero forcing in graphs
- Propagation time for zero forcing on a graph
- The CRC handbook of combinatorial designs
- The minimum rank of symmetric matrices described by a graph: a survey
- Transversals and domination in uniform hypergraphs
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing parameters and minimum rank problems
- Zero forcing sets and the minimum rank of graphs
Cited in
(9)- Permutation Tests for Infection Graphs
- Uniform forcing and immune sets in graphs and hypergraphs
- On the \(P_3\)-hull number of Kneser graphs
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- Zero forcing and maximum nullity for hypergraphs
- The infection time of graphs
- On infection in hypergraphs
- Infectious power domination of hypergraphs
- scientific article; zbMATH DE number 5931630 (Why is no real title available?)
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)
