Secure domination in cographs

DOI10.1016/J.DAM.2019.02.043MaRDI QIDQ2416434zbMATH OpenOpenAlexWikidataFDO

Authors Ryo Yamanaka, Toru Araki

Publication date 23 May 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.02.043

zbMATH Keywords

graph algorithmsecure dominationcograph

Mathematics Subject Classification ID

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

Recommendations

• The secure domination problem in cographs
• Secure domination in proper interval graphs
• The co-secure domination in proper interval graphs
• Two algorithms for secure graph domination
• A linear algorithm for secure domination in trees

Cites work

• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• A Linear Recognition Algorithm for Cographs
• A linear algorithm for secure domination in trees
• Complement reducible graphs
• Graphs \& digraphs
• On computing a minimum secure dominating set in block graphs
• On minimum secure dominating sets of graphs
• On secure domination in graphs
• On the secure domination numbers of maximal outerplanar graphs
• Secure domination and secure total domination in graphs
• Secure domination in proper interval graphs
• Two algorithms for secure graph domination
• Vertex Covers and Secure Domination in Graphs

Cited in

(23)

• Complexity results on cosecure domination in graphs
• Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
• Two algorithms for secure graph domination
• Co-secure and secure domination in graphs
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• The co-secure domination in proper interval graphs
• A linear algorithm for secure domination in trees
• Secure domination in rooted product graphs
• Secure domination parameters of Halin graph with perfect k-ary tree
• The algorithm and complexity of secure domination in 3-dimensional box graphs
• A lower bound for secure domination number of an outerplanar graph
• PTASs for secure dominating set in planar graphs and growth-bounded graphs
• Secure total domination in chain graphs and cographs
• Cosecure domination: hardness results and algorithms
• Restrained and total restrained domination in cographs
• Some new algorithmic results on co-secure domination in graphs
• Secure domination in proper interval graphs
• On the complexity of co-secure dominating set problem
• The possible cardinalities of global secure sets in cographs
• Secure domination in P₅-free graphs
• The secure domination problem in cographs
• A note on secure domination in C₅-free graphs
• Secure total domination number in maximal outerplanar graphs

This page was built for publication: Secure domination in cographs

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