Algorithmic aspects of certified domination in graphs

DOI10.22049/CCO.2021.27302.1226zbMath1524.05215OpenAlexW3185264186MaRDI QIDQ6101494

No author found.

Publication date: 1 June 2023

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14269_8f418c5112b2e5fec152287cbe0d932c.pdf

zbMATH Keywords

NP-completenesscertified dominationtree-convex bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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 (2)

Global triple Roman dominating function ⋮ Connected certified domination edge critical and stable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Threshold graphs and related topics
• Algorithmic aspects of 2-secure domination in graphs
• On the double Roman domination in graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Two Hardness Results on Feedback Vertex Sets
• Planar 3DM is NP-complete
• Total $k$-Rainbow domination numbers in graphs
• Algorithmic complexity of secure connected domination in graphs
• Reducibility among Combinatorial Problems
• Algorithmic aspects of total Roman {3}-domination in graphs
• Certified domination
• Algorithms and Computation

This page was built for publication: Algorithmic aspects of certified domination in graphs