A Constructive Characterization of Vertex Cover Roman Trees
A Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2. The Roman dominating function f is an outer-independent Roman dominating function on...
Main Authors: | Martínez Abel Cabrera, Kuziak Dorota, Yero Ismael G. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2021-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2179 |
Similar Items
-
Dominating Vertex Covers: The Vertex-Edge Domination Problem
by: Klostermeyer William F., et al.
Published: (2021-02-01) -
Independent Transversal Total Domination Versus Total Domination in Trees
by: Martínez Abel Cabrera, et al.
Published: (2021-02-01) -
Some Progress on the Double Roman Domination in Graphs
by: Rad Nader Jafari, et al.
Published: (2019-02-01) -
On Generalized Sierpiński Graphs
by: Rodríguez-Velázquez Juan Alberto, et al.
Published: (2017-08-01) -
On The Total Roman Domination in Trees
by: Amjadi Jafar, et al.
Published: (2019-05-01)