On the computational complexity of upper total domination

DOI10.1016/S0166-218X(03)00195-1zbMath1032.05096MaRDI QIDQ1421481

Qizhi Fang

Publication date: 26 January 2004

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

zbMATH Keywords

Linear programmingNP-completeUpper fractional total dominationUpper total domination

Mathematics Subject Classification ID

Combinatorial optimization (90C27) 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 (6)

The many facets of upper domination ⋮ Edge Weighting Functions on Dominating Sets ⋮ Edge weighting functions on semitotal dominating sets ⋮ Well-totally-dominated graphs ⋮ Algorithmic Aspects of Upper Domination: A Parameterised Perspective ⋮ Linear programming approach for various domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computational complexity of upper fractional domination
• Total domination in block graphs
• On the Algorithmic Complexity of Total Domination
• Total domination in graphs
• Universal minimal total dominating functions in graphs
• Total domination in interval graphs

This page was built for publication: On the computational complexity of upper total domination