Dynamic monopolies and feedback vertex sets in hexagonal grids

DOI10.1016/j.camwa.2011.09.047zbMath1236.91099OpenAlexW2071987125WikidataQ115100049 ScholiaQ115100049MaRDI QIDQ2429050

Denise Sakai Troxell, S. Luke Zinnen, Sarah Spence Adams

Publication date: 22 April 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.09.047

zbMATH Keywords

feedback vertex settarget set selectionhexagonal griddynamodynamic monopolymajority conversion process

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Special types of economic markets (including Cournot, Bertrand) (91B54)

Related Items (7)

Target set selection on generalized pancake graphs ⋮ Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids ⋮ On reversible cascades in scale-free and Erdős-Rényi random graphs ⋮ Triggering cascades on strongly connected directed graphs ⋮ Constant thresholds can make target set selection tractable ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results

Cites Work

• Unnamed Item
• Unnamed Item
• Feedback vertex set in hypercubes
• On dynamic monopolies of graphs with general thresholds
• Combinatorial model and bounds for target set selection
• Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
• Generalized honeycomb torus
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Almost exact minimum feedback vertex set in meshes and butterflies
• 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
• New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
• Minimum feedback vertex set and acyclic coloring.
• Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
• Bounding the Number of Tolerable Faults in Majority-Based Systems
• Optimal irreversible dynamos in chordal rings

This page was built for publication: Dynamic monopolies and feedback vertex sets in hexagonal grids