Complexity of Bondage and Reinforcement

Details Complexity of Bondage and Reinforcement Complexity of Bondage and Reinforcement

2011-09-08

arxiv.org/abs/1109.1657v1

Mathematics

Combinatorics

16 pages with 3 figures

Scientific paper

Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. A dominating set $D$ is called a total dominating set if every vertex in $D$ is adjacent to a vertex in $D$. The domination (resp. total domination) number of $G$ is the smallest cardinality of a dominating (resp. total dominating) set of $G$. The bondage (resp. total bondage) number of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination (resp. total domination) number of $G$. The reinforcement number of $G$ is the smallest number of edges whose addition to $G$ results in a graph with smaller domination number. This paper shows that the decision problems for bondage, total bondage and reinforcement are all NP-hard.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-474971