Open k-monopolies in graphs: complexity and related concepts

zbMath1400.05239arXiv1506.03779MaRDI QIDQ2965978

Ismael González Yero, Dorota Kuziak, Iztok Peterin

Publication date: 3 March 2017

Full work available at URL: https://arxiv.org/abs/1506.03779

zbMATH Keywords

graph products; total domination; efficient open domination; global defensive \(k\)-alliance; open \(k\)-monopolies; global offensive \(k\)-alliance; \(k\)-signed total domination

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C07: Vertex degrees

05C76: Graph operations (line graphs, products, etc.)