English

On the Roman Bondage Number of Graphs on surfaces

Combinatorics 2014-07-02 v1

Abstract

A Roman dominating function on a graph GG is a labeling f:V(G){0,1,2}f : V(G) \rightarrow \{0, 1, 2\} such that every vertex with label 00 has a neighbor with label 22. The Roman domination number, γR(G)\gamma_R(G), of GG is the minimum of ΣvV(G)f(v)\Sigma_{v\in V (G)} f(v) over such functions. The Roman bondage number bR(G)b_R(G) is the cardinality of a smallest set of edges whose removal from GG results in a graph with Roman domination number not equal to γR(G)\gamma_R(G). In this paper we obtain upper bounds on bR(G)b_{R}(G) 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 22-cell embedding on a surface with non negative Euler characteristic does not exceed 1515.

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