The bondage number of (n−3)(n-3)-regular graphs of order nn

preprint2011arXivOpen access

Abstract

Let G=(V,E)G=(V,E) be a graph. A subset D⊆VD\subseteq V is a dominating set if every vertex not in DD is adjacent to a vertex in DD. The domination number of GG is the smallest cardinality of a dominating set of GG. The bondage number of a nonempty graph GG is the smallest number of edges whose removal from GG results in a graph with larger domination number of GG. In this paper, we determine that the exact value of the bondage number of (n−3)(n-3)-regular graph GG of order nn is n−3n-3.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.