Upper bounds for the bondage number of graphs on topological surfaces

From MaRDI portal
Publication:385372

DOI10.1016/J.DISC.2011.10.018zbMATH Open1277.05125arXiv1012.4117OpenAlexW2169487918MaRDI QIDQ385372FDOQ385372

Andrei Gagarin, Vadim Zverovich

Publication date: 2 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that, for a graph G having the maximum vertex degree Delta(G) and embeddable on an orientable surface of genus h and a non-orientable surface of genus k, b(G)leminDelta(G)+h+2,Delta(G)+k+1. This generalizes known upper bounds for planar and toroidal graphs.


Full work available at URL: https://arxiv.org/abs/1012.4117




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Upper bounds for the bondage number of graphs on topological surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385372)