Immune sets in monotone infection rules. Characterization and complexity

DOI10.1016/j.dam.2023.06.032zbMath1530.92224OpenAlexW4383215131MaRDI QIDQ6064851

Xavier Muñoz, Jaume Martí-Farré, J. Fàbrega

Publication date: 11 December 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.06.032

zbMATH Keywords

complexitytarget set selectionbootstrap percolationzero forcing\(k\)-forcingimmune number

Mathematics Subject Classification ID

Epidemiology (92D30) Social networks; opinion dynamics (91D30) Applications of graph theory (05C90)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Failed skew zero forcing on a graph
• Combinatorial model and bounds for target set selection
• Upper bounds on the \(k\)-forcing number of a graph
• Mathematics of epidemics on networks. From exact to approximate models
• Rumor spreading in social networks
• On the complexity of failed zero forcing
• Computational aspects of monotone dualization: a brief survey
• The minimum rank of symmetric matrices described by a graph: a survey
• Clustering to minimize the maximum intercluster distance
• Effects of vertex degrees on the zero-forcing number and propagation time of a graph
• Nearly perfect sets in graphs
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• Blocking zero forcing processes in Cartesian products of graphs
• The failed zero forcing number of a graph
• Zero forcing sets and the minimum rank of graphs
• Extremal Combinatorics
• Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
• Dynamical Processes on Complex Networks
• The Zero Forcing Number of Graphs
• Domination in Graphs Applied to Electric Power Networks
• Dynamic approach to k-forcing
• On the Push&Pull Protocol for Rumor Spreading

This page was built for publication: Immune sets in monotone infection rules. Characterization and complexity