Complexity of Domination in Triangulated Plane Graphs

Abstract

We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.