Abstract
The bondage number of a graph is the smallest number of edges whose removal from results in a graph with larger domination number. Let be embeddable on a surface whose Euler characteristic is as large as possible, and assume . Gagarin-Zverovich and Huang have recently found upper bounds of in terms of the maximum degree and the Euler characteristic . In this paper we prove a better upper bound where is the largest real root of the cubic equation ; this upper bound is asymptotically equivalent to . We also establish further improved upper bounds for when the girth, order, or size of the graph is large compared with its Euler characteristic .
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.