Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
DOI10.1016/J.DAM.2012.02.011zbMATH Open1244.68060OpenAlexW1974903190MaRDI QIDQ427907FDOQ427907
Authors: Sarah Spence Adams, Paul Booth, Denise Sakai Troxell, S. Luke Zinnen 
Publication date: 18 June 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.02.011
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Network design and communication in computer systems (68M10)
Cites Work
- Bounding the number of tolerable faults in majority-based systems
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- Title not available (Why is that?)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Size bounds for dynamic monopolies
- Dynamic monopolies in tori.
- Dynamic monopolies of constant size
- Optimal irreversible dynamos in chordal rings
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- Irreversible \(k\)-threshold and majority conversion processes on complete multipartite graphs and graph products
- Title not available (Why is that?)
- Listen to Your Neighbors: How (Not) to Reach a Consensus
Cited In (10)
- Dynamic monopolies in two-way bootstrap percolation
- On dynamic monopolies of graphs with probabilistic thresholds
- Constant thresholds can make target set selection tractable
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- About a mathematical model of faults in contact networks
- Triggering cascades on strongly connected directed graphs
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
This page was built for publication: Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427907)
