On the Roman Bondage Number of Graphs on surfaces
Combinatorics
2014-07-02 v1
Abstract
A Roman dominating function on a graph is a labeling such that every vertex with label has a neighbor with label . The Roman domination number, , of is the minimum of over such functions. The Roman bondage number is the cardinality of a smallest set of edges whose removal from results in a graph with Roman domination number not equal to . In this paper we obtain upper bounds on in terms of (a) the average degree and maximum degree, and (b) Euler characteristic, girth and maximum degree. We also show that the Roman bondage number of every graph which admits a -cell embedding on a surface with non negative Euler characteristic does not exceed .
Keywords
Cite
@article{arxiv.1407.0367,
title = {On the Roman Bondage Number of Graphs on surfaces},
author = {Vladimir Samodivkin},
journal= {arXiv preprint arXiv:1407.0367},
year = {2014}
}
Comments
5 pages