Upper bounds for the bondage number of graphs on topological surfaces

From MaRDI portal
(Redirected from Publication:385372)




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.









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)