Abstract
A Roman dominating function on a graph G = (V(G), E(G)) is a labelling \({f : V(G)\rightarrow \{0,1,2\}}\) satisfying the condition that every vertex with label 0 has at least a neighbour with label 2. The Roman domination number γ R (G) of G is the minimum of \({\sum_{v \in V(G)}{f(v)}}\) over all such functions. The Roman bondage number b R (G) of G is the minimum cardinality of all sets \({E\subseteq E(G)}\) for which γ R (G \ E) > γ R (G). Recently, it was proved that for every planar graph P, b R (P) ≤ Δ(P) + 6, where Δ(P) is the maximum degree of P. We show that the Roman bondage number of every planar graph does not exceed 15 and construct infinitely many planar graphs with Roman bondage number equal to 7.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Carlson K., Develin M.: On the bondage number of planar and directed graphs. Discret. Math. 306, 820–826 (2006)
Jafari Rad N., Volkmann L.: Roman bondage in graphs. Discuss. Math. Graph Theory 31, 763–773 (2011)
Jafari Rad N., Volkmann L.: One the roman bondage number of planar graphs. Graphs Comb. 27, 531–538 (2011)
Jendrol’ S., Madaras T.: On light subgraphs in plane graphs of minimum degree five. Discuss. Math. Graph Theory 16, 207–217 (1996)
Kang L., Yuan J.: Bondage number of planar graphs. Discret. Math. 222, 191–198 (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Akbari, S., Khatirinejad, M. & Qajar, S. A Note on the Roman Bondage Number of Planar Graphs. Graphs and Combinatorics 29, 327–331 (2013). https://doi.org/10.1007/s00373-011-1129-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1129-8