Restrained and total restrained domination in cographs

DOI10.1007/978-3-030-93176-6_36MaRDI QIDQ2151385zbMATH OpenOpenAlexFDO

Authors Moo Young Sohn, Xuegang Chen

Publication date 1 July 2022

Full work available at URL https://doi.org/10.1007/978-3-030-93176-6_36

zbMATH Keywords

cographstotal restrained domination numberrestrained domination number

Mathematics Subject Classification ID

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

Recommendations

• Restrained domination in graphs
• On total restrained domination in graphs
• Total restrained domination in graphs
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• On the total restrained domination number of a graph

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• On total restrained domination in graphs
• Restrained domination in graphs
• Secure domination in cographs
• Total restrained domination in claw-free graphs with minimum degree at least two

Cited in

(3)

• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
• On equality in an upper bound for the restrained and total domination numbers of a graph

This page was built for publication: Restrained and total restrained domination in cographs

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