Abstract
Abstract We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have