Note on the bondage number of graphs on topological surfaces
Combinatorics
2012-08-31 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1208.6203,
title = {Note on the bondage number of graphs on topological surfaces},
author = {Vladimir Samodivkin},
journal= {arXiv preprint arXiv:1208.6203},
year = {2012}
}
Comments
4 pages