Note on the bondage number of graphs on topological surfaces

2012/08/30 by Samodivkin, Vladimir
#05C69 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1208.6203

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.

Related

• The bondage number of graphs on topological surfaces: degree-S vertices and the average degree
• On Bondage Numbers of Graphs -- a survey with some comments
• Upper bounds for domination related parameters in graphs on surfaces
• On Total Bondage Number of Graphs
• The Bondage Number of Mesh Networks