On the complexity of signed domination

DOI10.1007/978-3-032-27732-9_34MaRDI QIDQ7363407zbMATH OpenFDO

Authors Sangam Balchandar Reddy

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_34

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A note on the lower bounds of signed domination number of a graph
• Algorithmic meta-theorems for restrictions of treewidth
• Algorithms and Hardness for Signed Domination
• Graph Layout Problems Parameterized by Vertex Cover
• scientific article; zbMATH DE number 825134 (Why is no real title available?)
• scientific article; zbMATH DE number 861417 (Why is no real title available?)
• Inequalities relating domination parameters in cubic graphs
• Kernelization and Lower Bounds of the Signed Domination Problem
• Minus domination in small-degree graphs
• On structural parameterizations of the bounded-degree vertex deletion problem
• Parameterized algorithms
• Reducibility among combinatorial problems
• Signed domination in regular graphs
• Variations of \(Y\)-dominating functions on graphs

This page was built for publication: On the complexity of signed domination

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