The complexity of the defensive domination problem in special graph classes

DOI10.1016/J.DISC.2019.111665MaRDI QIDQ2279988zbMATH OpenOpenAlexWikidataFDO

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

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

dominationnetworkssecurity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2170409
• Defensive domination in proper interval graphs
• Global defensive sets in graphs
• Cops, a fast robber and defensive domination on interval graphs
• Algorithmic aspects of the \(k\)-domination problem in graphs

Cites work

• A new representation of proper interval graphs with an application to clique-width
• Algorithmic graph theory and perfect graphs
• Clustering and domination in perfect graphs
• Cops, a fast robber and defensive domination on interval graphs
• Difference graphs
• Dominating sets for split and bipartite graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2170409 (Why is no real title available?)
• scientific article; zbMATH DE number 2094533 (Why is no real title available?)
• scientific article; zbMATH DE number 841999 (Why is no real title available?)
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• On minimum secure dominating sets of graphs
• On secure domination in graphs
• Secure domination and secure total domination in graphs
• Secure domination in proper interval graphs
• The Complexity of the Partial Order Dimension Problem

Cited in

(5)

• Approximation algorithm and hardness results for defensive domination in graphs
• Defensive domination in proper interval graphs
• scientific article; zbMATH DE number 2170409 (Why is no real title available?)
• More on the complexity of defensive domination in graphs
• A note on the complexity of defensive domination

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279988)