Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives

DOI10.1016/j.disc.2019.04.006zbMath1414.05220OpenAlexW2963092280MaRDI QIDQ2421880

Dieter Rautenbach, Christoph Brause, Stefan Ehard

Publication date: 18 June 2019

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

Full work available at URL: https://doi.org/10.1016/j.disc.2019.04.006

zbMATH Keywords

independent settarget setdynamic monopolydegenerate set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Combinatorial model and bounds for target set selection
• New bounds for contagious sets
• Independence in connected graphs
• Large induced degenerate subgraphs
• A note on the independence number of triangle-free graphs. II
• A probabilistic lower bound on the independence number of graphs
• Discovering small target sets in social networks: a fast and effective algorithm
• A new lower bound on the independence number of graphs
• Whom to befriend to influence people
• On Selkow's bound on the independence number of graphs
• A Better Bound on the Variance
• Optimizing Spread of Influence in Social Networks via Partial Incentives
• On the Approximability of Influence in Social Networks

This page was built for publication: Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives