A study of monopolies in graphs
Publication:367095
DOI10.1007/S00373-012-1214-7zbMATH Open1272.05149OpenAlexW1977262251MaRDI QIDQ367095FDOQ367095
Manouchehr Zaker, M. Nemati, Kaveh Khoshkhah, Hossein Soltani
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching theory
- Local majorities, coalitions and monopolies in graphs: A review
- On time versus size for monotone dynamic monopolies in regular topologies
- On dynamic monopolies of graphs with general thresholds
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- On the global offensive alliance number of a graph
- Offensive \(r\)-alliances in graphs
- Global alliances and independent domination in some classes of graphs
- The power of small coalitions in graphs
- Minimum monopoly in regular and tree graphs
- Offensive alliances in cubic graphs
- Offensive alliances in graphs
- Bounds for chromatic number in terms of even-girth and booksize
Cited In (11)
- On dynamic monopolies of graphs: the average and strict majority thresholds
- The complexity of open k-monopolies in graphs for negative k
- Minimum monopoly in regular and tree graphs
- Title not available (Why is that?)
- Facets of the dynamic monopoly polytope: linear ordering formulation
- Vector domination in split-indifference graphs
- Bounding the open \(k\)-monopoly number of strong product graphs
- On the complexity of reasoning about opinion diffusion under majority dynamics
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
- A polyhedral study of dynamic monopolies
- Integer programming approach to static monopolies in graphs
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Integer programming approach to static monopolies in graphs 👍 👎
- On dynamic monopolies of graphs with general thresholds 👍 👎
- On dynamic monopolies of graphs: the average and strict majority thresholds 👍 👎
- Open k-monopolies in graphs: complexity and related concepts 👍 👎
- ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC 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 👍 👎
- Weak dynamic monopolies in social 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)
