scientific article; zbMATH DE number 2170409

MaRDI QIDQ4677897zbMATH OpenFDO

Authors Arthur M. Farley, Andrzej Proskurowski

Publication date 23 May 2005

zbMATH Keywords

dominationgraphsnetworkssecurity

Mathematics Subject Classification ID

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

Recommendations

• The complexity of the defensive domination problem in special graph classes
• Security in graphs
• Defensive domination in proper interval graphs
• Global defensive sets in graphs
• Rooted secure sets of trees

Cited in

(7)

• Blockbusting and domineering
• Approximation algorithm and hardness results for defensive domination in graphs
• The complexity of the defensive domination problem in special graph classes
• Cops, a fast robber and defensive domination on interval graphs
• Defensive domination in proper interval graphs
• More on the complexity of defensive domination in graphs
• A note on the complexity of defensive domination

This page was built for publication:

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