On the Roman k -bondage number of a graph
Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann, S. Arumugam · AKCE International Journal of Graphs and Combinatorics · 2011
A Roman dominating function on a graph G = (V, E) is a function f: V → {0, 1, 2} such that every vertex v ∊ V with f(v) = 0 has at least one neighbor u ∊ V with f(u) = 2. The weight of a Roman domi...