Note on the bondage number of graphs on topological surfaces
classification
🧮 math.CO
keywords
numberbondagegraphboundscharacteristicdominationedgeseuler
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.