The secure domination problem in cographs

DOI10.1016/j.ipl.2019.01.005zbMath1451.05177OpenAlexW2910118765MaRDI QIDQ1730021

Dina Pradhan, Sumanta Banerjee, Anupriya Jha

Publication date: 11 March 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.01.005

zbMATH Keywords

polynomial-time algorithmgraph algorithmscographsdominationsecure domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

A polynomial-time approximation to a minimum dominating set in a graph ⋮ Perfect Italian domination in cographs ⋮ Secure domination of some graph operators ⋮ The restrained double Roman domination in graphs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee ⋮ Secure domination in rooted product graphs ⋮ Secure total domination in chain graphs and cographs

Cites Work

• Unnamed Item
• Unnamed Item
• Irredundance, secure domination and maximum degree in trees
• Complement reducible graphs
• Secure domination in proper interval graphs
• On the secure domination numbers of maximal outerplanar graphs
• On computing a minimum secure dominating set in block graphs
• The complexity of secure domination problem in graphs
• On secure domination in graphs
• A linear algorithm for secure domination in trees
• Secure domination and secure total domination in graphs
• A Linear Recognition Algorithm for Cographs
• On minimum secure dominating sets of graphs
• On secure domination in trees

This page was built for publication: The secure domination problem in cographs