Note on the bondage number of graphs on topological surfaces

From MaRDI portal
Publication:2848734




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.









This page was built for publication: Note on 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 Q2848734)