Complexity and approximation algorithm of 3-component domination in graphs

DOI10.1007/978-3-032-17156-6_17MaRDI QIDQ7307326zbMATH OpenFDO

Authors Subhasmita Joshi, B. S. Panda

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_17

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• 3-component domination numbers in graphs
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• Analytical approach to parallel repetition
• Dominating sets inducing large components
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• On 3-component domination numbers in graphs
• Some APX-completeness results for cubic graphs

This page was built for publication: Complexity and approximation algorithm of 3-component domination in graphs

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