Abstract
Let be a graph. A subset is a dominating set if every vertex not in is adjacent to a vertex in . The domination number of is the smallest cardinality of a dominating set of . The bondage number of a nonempty graph is the smallest number of edges whose removal from results in a graph with larger domination number of . In this paper, we determine that the exact value of the bondage number of -regular graph of order is .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.