On the Signed (Total) $k$-Domination Number of a Graph

zbMath1301.05252arXiv1204.4827MaRDI QIDQ2875894

Hongyu Liang

Publication date: 12 August 2014

Full work available at URL: https://arxiv.org/abs/1204.4827

zbMATH Keywords

signed total \(k\)-domination numbersigned \(k\)-dominating functions

Mathematics Subject Classification ID

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)

New and improved results on the signed (total) k-domination number of graphs ⋮ The complexity of open k-monopolies in graphs for negative k ⋮ Lower bounds on the signed (total) $k$-domination number

This page was built for publication: On the Signed (Total) $k$-Domination Number of a Graph