Weighted restrained domination in subclasses of planar graphs

DOI10.1016/j.tcs.2016.03.022zbMath1339.05298OpenAlexW2305837256MaRDI QIDQ278718

William Chung-Kung Yen

Publication date: 2 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.022

zbMATH Keywords

NP-hard problemscactus graphsplanar bipartite graphsweighted restrained domination

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

The restrained double Roman domination in graphs ⋮ Restrained domination in self-complementary graphs ⋮ Invulnerability of planar two-tree networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On roman, global and restrained domination in graphs
• Graphs with large restrained domination number
• Restrained domination in graphs
• Restrained domination in trees
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• Unsolved algorithmic problems on trees
• On weak and restrained domination in trees
• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• Centdian Computation in Cactus Graphs
• Planar 3DM is NP-complete
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• The cototal domination number of a graph
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
• On the p-domination number of cactus graphs

This page was built for publication: Weighted restrained domination in subclasses of planar graphs