Open k-monopolies in graphs: complexity and related concepts
From MaRDI portal
Publication:2965978
zbMath1400.05239arXiv1506.03779MaRDI QIDQ2965978
Iztok Peterin, Ismael González Yero, Dorota Kuziak
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1506.03779
graph productstotal dominationefficient open dominationglobal defensive \(k\)-allianceopen \(k\)-monopoliesglobal offensive \(k\)-alliance\(k\)-signed total domination
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Total perfect codes in Cayley graphs, On the perfect differential of a graph, Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs, Total Roman domination in the lexicographic product of graphs, (Open) packing number of some graph products, The complexity of open k-monopolies in graphs for negative k, Bounding the open \(k\)-monopoly number of strong product graphs, Efficient closed domination in digraph products, A note on domination and total domination in prisms, \([1,k\)-domination number of lexicographic products of graphs], Graphs that are simultaneously efficient open domination and efficient closed domination graphs, On the 2-packing differential of a graph, Approximability of open \(k\)-monopoly problems
