Global defensive sets in graphs

DOI10.1016/j.disc.2016.01.022zbMath1334.05107OpenAlexW2288881313MaRDI QIDQ279197

Robert Lewoń, Michał Małafiejski, Anna Małafiejska

Publication date: 27 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.01.022

zbMATH Keywords

NP-completenessdominationalliancedefensive set

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Global edge alliances in graphs ⋮ Alliances and Related Domination Parameters ⋮ Algorithms and Complexity of Alliances in Graphs

Cites Work

• Global defensive alliances of trees and Cartesian product of paths and cycles
• Cooperative mobile guards in grids
• Global defensive \(k\)-alliances in graphs
• Global defensive alliances in star graphs
• Defensive \(k\)-alliances in graphs
• Global defensive alliances in graphs
• Local majorities, coalitions and monopolies in graphs: A review
• Some bounds on global alliances in trees
• Global alliances in planar graphs
• On defensive alliances and line graphs
• A note on global alliances in trees
• Total Domination in Graphs
• Spectral study of alliances in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Global defensive sets in graphs