The Distance Roman Domination Numbers of Graphs
Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → {0, 1, 2} such that for every vertex with label 0, there is a vertex with label 2 at distance at most k from each other. The weight of a k-distance Ro...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2013-09-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1703 |