The complexity of the defensive domination problem in special graph classes

DOI10.1016/j.disc.2019.111665zbMath1429.05155OpenAlexW2976402378WikidataQ127202333 ScholiaQ127202333MaRDI QIDQ2279988

Tınaz Ekim, Andrzej Proskurowski, Arthur M. Farley

Publication date: 17 December 2019

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

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

zbMATH Keywords

networkssecuritydomination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Approximation algorithm and hardness results for defensive domination in graphs ⋮ Defensive domination in proper interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating sets for split and bipartite graphs
• Clustering and domination in perfect graphs
• Secure domination in proper interval graphs
• Algorithmic graph theory and perfect graphs
• Cops, a fast robber and defensive domination on interval graphs
• On secure domination in graphs
• A new representation of proper interval graphs with an application to clique-width
• Secure domination and secure total domination in graphs
• The Complexity of the Partial Order Dimension Problem
• On minimum secure dominating sets of graphs
• Difference graphs

This page was built for publication: The complexity of the defensive domination problem in special graph classes