Complexity of Roman {2}-domination and the double Roman domination in graphs

For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of an R2DF is called the Roman {2}-domination numb...

Full description

Bibliographic Details
Main Authors: Chakradhar Padamutham, Venkata Subba Reddy Palagiri
Format: Article
Language:English
Published: Taylor & Francis Group 2020-09-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:http://dx.doi.org/10.1016/j.akcej.2020.01.005

Similar Items