On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold

DOI10.4153/CMB-2015-021-4zbMath1312.05109arXiv1405.6138OpenAlexW2963872159MaRDI QIDQ5252193

Manouchehr Zaker, Kaveh Khoshkhah

Publication date: 29 May 2015

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.6138

zbMATH Keywords

target set selectionirreversible dynamic monopoliesspread of influence in graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Vaccinate your trees! ⋮ Partial immunization of trees

This page was built for publication: On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold