Unique Response Roman Domination: Complexity and Algorithms

A function f : V ( G ) → { 0 , 1 , 2 } is called a Roman dominating function on G = ( V ( G ) , E ( G ) ) if for every vertex v with f ( v ) = 0 , there exists a vertex u ∈ N G ( v ) such that f ( u ) = 2 . A function f : V ( G ) → { 0 , 1 , 2 } induces an ordered partition ( V 0 , V 1 , V 2 ) of V...

Celý popis