Hardness results of global total \(k\)-domination problem in graphs

DOI10.1007/978-3-030-39219-2_8zbMath1453.68142OpenAlexW3002535367MaRDI QIDQ5896106

Pooja Goyal, B. S. Panda

Publication date: 21 July 2020

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (2)

Global total \(k\)-domination: approximation and hardness results ⋮ Hardness results of global total \(k\)-domination problem in graphs

This page was built for publication: Hardness results of global total \(k\)-domination problem in graphs