Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Roman Bondage Number of Graphs on surfaces

Published 1 Jul 2014 in math.CO | (1407.0367v1)

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

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.