On the Roman bondage number of a graph

Details On the Roman bondage number of a graph On the Roman bondage number of a graph

2012-04-06

arxiv.org/abs/1204.1438v1

Mathematics

Combinatorics

15 pages, 35 references

Scientific paper

A Roman dominating function on a graph $G=(V,E)$ is a function $f:V\rightarrow\{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)=2$. The weight of a Roman dominating function is the value $f(V(G))=\sum_{u\in V(G)}f(u)$. The minimum weight of a Roman dominating function on a graph $G$ is called the Roman domination number, denoted by $\gamma_{R}(G)$. The Roman bondage number $b_{R}(G)$ of a graph $G$ with maximum degree at least two is the minimum cardinality of all sets $E'\subseteq E(G)$ for which $\gamma_{R}(G-E')>\gamma_R(G)$. In this paper, we first show that the decision problem for determining $b_{\rm R}(G)$ is NP-hard even for bipartite graphs and then we establish some sharp bounds for $b_{\rm R}(G)$ and characterizes all graphs attaining some of these bounds.

Affiliated with

Also associated with

No associations

Rating

On the Roman bondage number of a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Roman bondage number of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Roman bondage number of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183501