arXiv Analytics

Sign in

arXiv:1208.6203 [math.CO]AbstractReferencesReviewsResources

Note on the bondage number of graphs on topological surfaces

Vladimir Samodivkin

Published 2012-08-30Version 1

The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. In this paper we present new upper bounds for b(G) in terms of girth, order and Euler characteristic.

Comments: 4 pages
Categories: math.CO
Subjects: 05C69
Related articles: Most relevant | Search more
arXiv:1209.1362 [math.CO] (Published 2012-09-06)
The bondage number of graphs on topological surfaces and Teschner's conjecture
arXiv:1111.5629 [math.CO] (Published 2011-11-23, updated 2012-05-21)
An improved upper bound for the bondage number of graphs on surfaces
arXiv:1012.4117 [math.CO] (Published 2010-12-18, updated 2011-10-25)
Upper bounds for the bondage number of graphs on topological surfaces

Links

Toolbox