A study of monopolies in graphs
From MaRDI portal
Publication:367095
DOI10.1007/s00373-012-1214-7zbMath1272.05149OpenAlexW1977262251MaRDI QIDQ367095
Mohammad Hasan, M. Dambrine, H. S. Yoon
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1214-7
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
The complexity of open k-monopolies in graphs for negative k ⋮ Bounding the open \(k\)-monopoly number of strong product graphs ⋮ On dynamic monopolies of graphs: the average and strict majority thresholds ⋮ Integer programming approach to static monopolies in graphs ⋮ Vector domination in split-indifference graphs ⋮ A polyhedral study of dynamic monopolies ⋮ Facets of the dynamic monopoly polytope: linear ordering formulation ⋮ On the complexity of reasoning about opinion diffusion under majority dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- On dynamic monopolies of graphs with general thresholds
- Bounds for chromatic number in terms of even-girth and booksize
- On the global offensive alliance number of a graph
- Offensive \(r\)-alliances in graphs
- Global alliances and independent domination in some classes of graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Matching theory
- Local majorities, coalitions and monopolies in graphs: A review
- The power of small coalitions in graphs
- On time versus size for monotone dynamic monopolies in regular topologies
- Minimum monopoly in regular and tree graphs
- Offensive alliances in cubic graphs
- Offensive alliances in graphs
This page was built for publication: A study of monopolies in graphs
