Pages that link to "Item:Q1730021"

The following pages link to The secure domination problem in cographs (Q1730021):

Displaying 8 items.

• Secure domination in rooted product graphs (Q2025078) (← links)
• A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
• Perfect Italian domination in cographs (Q2661056) (← links)
• The restrained double Roman domination in graphs (Q2683144) (← links)
• Secure total domination in chain graphs and cographs (Q4956172) (← links)
• Secure domination of some graph operators (Q6089327) (← links)
• Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang (Q6157427) (← links)