The secure domination problem in cographs
type: Item
instance of: scholarly article
title: The secure domination problem in cographs
zbMATH Open document ID: 1451.05177
author: Anupriya Jha
author: Dina Pradhan
author: Sumanta Banerjee
published in: Information Processing Letters
publication date: 2019-03-11T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7033885
zbMATH Keywords: domination
zbMATH Keywords: secure domination
zbMATH Keywords: cographs
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2019.01.005
OpenAlex ID: W2910118765
cites work: Secure domination in proper interval graphs
cites work: On the secure domination numbers of maximal outerplanar graphs
cites work: A linear algorithm for secure domination in trees
cites work: On minimum secure dominating sets of graphs
cites work: Q5298923
cites work: Q5461685
cites work: Irredundance, secure domination and maximum degree in trees
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Secure domination and secure total domination in graphs
cites work: On secure domination in trees
cites work: On secure domination in graphs
cites work: On computing a minimum secure dominating set in block graphs
cites work: The complexity of secure domination problem in graphs
DOI: 10.1016/J.IPL.2019.01.005
description: scientific article; zbMATH DE number 7033885