On dynamic monopolies of graphs with general thresholds
From MaRDI portal
Publication:409449
DOI10.1016/j.disc.2011.11.038zbMath1238.05262arXiv1103.1112OpenAlexW1677630274MaRDI QIDQ409449
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.1112
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Related Items (27)
Discovering small target sets in social networks: a fast and effective algorithm ⋮ Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks ⋮ Generalized threshold processes on graphs ⋮ ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS ⋮ A study of monopolies in graphs ⋮ Target set selection with maximum activation time ⋮ Bounding the open \(k\)-monopoly number of strong product graphs ⋮ Target set selection on generalized pancake graphs ⋮ Dynamic monopolies and feedback vertex sets in hexagonal grids ⋮ 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 ⋮ Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs ⋮ Latency-bounded target set selection in social networks ⋮ Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks ⋮ Triggering cascades on strongly connected directed graphs ⋮ Integer programming approach to static monopolies in graphs ⋮ The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ The k-conversion number of regular graphs ⋮ A polyhedral study of dynamic monopolies ⋮ Facets of the dynamic monopoly polytope: linear ordering formulation ⋮ Whom to befriend to influence people ⋮ Influence diffusion in social networks under time window constraints ⋮ Spread of influence in weighted networks under time and budget constraints ⋮ Influence Diffusion in Social Networks under Time Window Constraints ⋮ Exact solutions for latency-bounded target set selection problem on some special families of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On dynamic monopolies of graphs: the average and strict majority thresholds
- Subgraphs of minimal degree \(k\)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Spreading messages
- Probabilistic methods for algorithmic discrete mathematics
- Size bounds for dynamic monopolies
- Dynamic monopolies in tori.
- Local majorities, coalitions and monopolies in graphs: A review
- On time versus size for monotone dynamic monopolies in regular topologies
- Dynamic monopolies of constant size
- On the Approximability of Influence in Social Networks
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- Optimal irreversible dynamos in chordal rings
This page was built for publication: On dynamic monopolies of graphs with general thresholds
