Recommendations
- On the monopoly of graphs
- On dynamic monopolies of graphs with general thresholds
- On dynamic monopolies of graphs with probabilistic thresholds
- Integer programming approach to static monopolies in graphs
- On dynamic monopolies of graphs: the average and strict majority thresholds
- On monopoly and dynamic monopoly of Cartesian product of graphs with constant thresholds.
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
- Independent monopoly size in graphs
- Weak dynamic monopolies in social graphs
Cites work
- scientific article; zbMATH DE number 2104820 (Why is no real title available?)
- Bounds for chromatic number in terms of even-girth and booksize
- Global alliances and independent domination in some classes of graphs
- Graph theory
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Local majorities, coalitions and monopolies in graphs: A review
- Matching theory
- Minimum monopoly in regular and tree graphs
- Offensive \(r\)-alliances in graphs
- Offensive alliances in cubic graphs
- Offensive alliances in graphs
- On dynamic monopolies of graphs with general thresholds
- On the global offensive alliance number of a graph
- On time versus size for monotone dynamic monopolies in regular topologies
- The power of small coalitions in graphs
Cited in
(17)- On dynamic monopolies of graphs: the average and strict majority thresholds
- Independent monopoly size in graphs
- On the monopoly of graphs
- Partitioning a graph into monopoly sets
- Minimum monopoly in regular and tree graphs
- Max- and Min-neighborhood monopolies
- scientific article; zbMATH DE number 1617284 (Why is no real title available?)
- Facets of the dynamic monopoly polytope: linear ordering formulation
- The complexity of open \(k\)-monopolies in graphs for negative \(k\)
- Vector domination in split-indifference graphs
- On the complexity of reasoning about opinion diffusion under majority dynamics
- Bounding the open \(k\)-monopoly number of strong product graphs
- On the monopolies of lexicographic product graphs: bounds and closed formulas
- A polyhedral study of dynamic monopolies
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
- An improved derandomized approximation algorithm for the max-controlled set problem
- Integer programming approach to static monopolies in graphs
This page was built for publication: A study of monopolies in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367095)
