On dynamic monopolies of graphs: The average and strict majority thresholds-Reference-Cited by-同舟云学术

On dynamic monopolies of graphs: The average and strict majority thresholds

Published:2012-05 Issue:2 Volume:9 Page:77-83
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Khoshkhah Kaveh,Soltani Hossein,Zaker Manouchehr

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference18 articles.

1. Graph Theory;Bondy,2008

2. Irreversible dynamos in chordal rings;Flocchini;Discrete Appl. Math.,2001

3. On time versus size for monotone dynamic monopolies in regular topologies;Flocchini;J. Discrete Algorithms,2003

4. Dynamic monopolies in Tori;Flocchini;Discrete Appl. Math.,2004

5. F. Luccio, L. Pagli, H. Sanossian, Irreversible dynamos in butterflies, in: Proc. 6th Colloq. on Structural Information & Communication Complexity, Bordeaux, France, July 1999, pp. 204–218.

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SOME RESULTS ON NON-PROGRESSIVE SPREAD OF INFLUENCE IN GRAPHS;TRANS COMB;2024

2. Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs;Journal of Combinatorial Optimization;2024-04-25

3. Facets of the dynamic monopoly polytope: Linear ordering formulation;Discrete Optimization;2021-05

4. The t-latency bounded strong target set selection problem in some kinds of special family of graphs;Journal of Combinatorial Optimization;2020-11-10

5. On the complexity of reasoning about opinion diffusion under majority dynamics;Artificial Intelligence;2020-07