Bounding the open \(k\)-monopoly number of strong product graphs

DOI10.7151/dmgt.2017zbMath1377.05144OpenAlexW2765585216MaRDI QIDQ1692650

Dorota Kuziak, Iztok Peterin, Ismael González Yero

Publication date: 10 January 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2017

zbMATH Keywords

dominationstrong product graphsalliancesopen monopolies

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The complexity of open k-monopolies in graphs for negative k

Cites Work

• A study of monopolies in graphs
• On dynamic monopolies of graphs with general thresholds
• Local majorities, coalitions and monopolies in graphs: A review
• On time versus size for monotone dynamic monopolies in regular topologies
• Perfect codes in graphs
• Open k-monopolies in graphs: complexity and related concepts
• Minimum Monopoly in Regular and Tree Graphs
• How to assign votes in a distributed system
• Fault Tolerance in Networks of Bounded Degree
• Computing the (k-)monopoly number of direct product of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounding the open \(k\)-monopoly number of strong product graphs