Roman Bondage Numbers of Some Graphs

Details Roman Bondage Numbers of Some Graphs Roman Bondage Numbers of Some Graphs

2011-09-19

arxiv.org/abs/1109.3933v1

Mathematics

Combinatorics

10 pages

Scientific paper

A Roman dominating function on a graph $G=(V,E)$ is a function $f: V\to \{0,1,2\}$ satisfying the condition that every vertex $u$ with $f(u)=0$ is adjacent to at least one vertex $v$ with $f(v)=2$. The weight of a Roman dominating function is the value $f(G)=\sum_{u\in V} f(u)$. The Roman domination number of $G$ is the minimum weight of a Roman dominating function on $G$. The Roman bondage number of a nonempty graph $G$ is the minimum number of edges whose removal results in a graph with the Roman domination number larger than that of $G$. This paper determines the exact value of the Roman bondage numbers of two classes of graphs, complete $t$-partite graphs and $(n-3)$-regular graphs with order $n$ for any $n\ge 5$.

Affiliated with

Also associated with

No associations

Rating

Roman Bondage Numbers of Some Graphs 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 Roman Bondage Numbers of Some Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Roman Bondage Numbers of Some Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96221