Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
From MaRDI portal
Publication:511918
DOI10.1016/j.tcs.2016.12.028zbMath1358.05162arXiv1601.02099MaRDI QIDQ511918
Dieter Rautenbach, Michael Gentner
Publication date: 22 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.02099
05C40: Connectivity
Related Items
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree, Fast and frugal targeting with incentives, Partial immunization of trees, Vaccinate your trees!
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial model and bounds for target set selection
- New bounds for contagious sets
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
- On dynamic monopolies of graphs: the average and strict majority thresholds
- Triggering cascades on strongly connected directed graphs
- Irreversible conversion of graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Large induced degenerate subgraphs
- Size bounds for dynamic monopolies
- Triggering cascades on undirected connected graphs
- Remarks on dynamic monopolies with given average thresholds
- An inclusion hierarchy of irreversible dynamos
- Large independent sets in regular graphs of large girth
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- Geodetic Number versus Hull Number in $P_3$-Convexity
- Multi-level dynamo and opinion spreading
- Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach
- On the Approximability of Influence in Social Networks
- The potential of greed for independence
