Litcius/Paper detail

Hardness results of global total <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e194" altimg="si25.svg"><mml:mi>k</mml:mi></mml:math>-domination problem in graphs

B. S. Panda, Pooja Goyal

2021Discrete Applied Mathematics11 citationsDOI

Topics & Concepts

Dominating setMathematicsDomination analysisBipartite graphCombinatoricsParameterized complexityChordal graphBounded functionGraphDiscrete mathematicsVertex (graph theory)Mathematical analysisAdvanced Graph Theory ResearchComplexity and Algorithms in GraphsOptimization and Search Problems
Hardness results of global total <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e194" altimg="si25.svg"><mml:mi>k</mml:mi></mml:math>-domination problem in graphs | Litcius