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...
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
-
Total double Roman domination in graphs
by: Guoliang Hao, et al.
Published: (2020-06-01) -
On the Outer-Independent Double Roman Domination of Graphs
by: Yongsheng Rao, et al.
Published: (2021-02-01) -
Double Roman domination and domatic numbers of graphs
by: L. Volkmann
Published: (2018-01-01) -
Progress on Roman and Weakly Connected Roman Graphs
by: Joanna Raczek, et al.
Published: (2021-08-01) -
Independent double Roman domination in graphs
by: H. R. Maimani, et al.
Published: (2020-09-01)