On the Roman bondage number of a graph

A. Bahremandpour, Fu-Tao Hu, S. M. Sheikholeslami +1

A Roman dominating function on a graph $G=(V,E)$ is a function $f:V\to \{0,1,2\}$ such that every vertex $v\in V$ with $f(v)=0$ has at least one neighbor $u\in V$ with $f(u)…