On the Roman bondage Number of a Graph

Abstract

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 dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number… (More)
DOI: 10.1142/S1793830913500018

Topics

Cite this paper

@article{Bahremandpour2013OnTR, title={On the Roman bondage Number of a Graph}, author={A. Bahremandpour and Fu-Tao Hu and Seyed Mahmoud Sheikholeslami and Jun-Ming Xu}, journal={Discrete Math., Alg. and Appl.}, year={2013}, volume={5} }