Bounds on the Locating Roman Domination Number in Trees
A Roman dominating function (or just RDF) on a graph G = (V, E) is a function f : V → {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 weight of an RDF f is the value f(V (G)) = ∑u∈V(G)f(u). An RDF f can be represe...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2018-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1989 |