Abstract
A Roman dominating function (RDF) on a graph G is a labelling \(f: V(G) \rightarrow \{0, 1, 2\}\) such that every vertex with label 0 has a neighbor with label 2. A vertex u with f(u) = 0 is said to be undefended with respect to f if it is not adjacent to a vertex v with the positive weight. A function \(f:V(G) \rightarrow \{0, 1, 2\}\) is a weak Roman dominating function (WRDF) if each vertex u with \(f(u) = 0\) is adjacent to a vertex v with \(f(v) > 0\) such that the function \(f^{\prime }: V(G) \rightarrow \{0, 1, 2\}\) defined by \(f^{\prime }(u) = 1\), \(f^{\prime }(v) = f(v) - 1\) and \(f^{\prime }(w) = f(w)\) if \(w \in V - \{u, v\}\), has no undefended vertex. The Roman bondage number \(b_R(G)\) of a graph G with maximum degree at least two is the minimum cardinality of all sets \(\ E^{\prime } \subseteq E(G)\) for which \(\gamma _R(G-E^{\prime }) > \gamma _R(G)\). We extend this concept to a weak Roman dominating function as follows: The weak Roman bondage number \(b_r(G)\) of a graph G with maximum degree at least two is the minimum cardinality of all sets \(\ E^{\prime } \subseteq E(G)\) for which \(\gamma _r\)(\(G - E^{\prime }\)) \(> \gamma _r(G)\). In this paper we determine the exact values of the weak Roman bondage number for paths, cycles and complete bipartite graphs. We obtain bounds for trees and unicyclic graphs and characterize the extremal graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bauer, D., Harary, F., Nieminen, J., Suffel, C.L.: Domination alteration sets in graphs. Discrete Math. 47, 153–161 (1983)
Cockayne, E.J., Dreyer, P.A., Hedetniemi, S.M.: Roman domination in graphs. Discrete Math. 78, 11–22 (2004)
Fink, J.F., Jacobson, M.S., Kinch, L.F., Roberts, J.: The bondage number of a graph. Discrete Math. 86, 47–57 (1990)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Domination in Graphs. Advanced Topics. Marcel Dekker, New York (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Hedetniemi, S.T., Henning, M.A.: Defending the Roman Empire - A new strategy. Discrete Math. 266, 239–251 (2003)
Henning, M.A.: A characterization of Roman trees. Discuss. Math. Graph Theory. 22, 325–334 (2002)
Henning, M.A.: Defending the Roman Empire from multiple attacks. Discrete Math. 271, 101–115 (2003)
Jafari Rad, N., Volkmann, L.: Roman bondage in graphs. Discuss. Math. 31, 763–773 (2011)
Revelle, C.S.: Can you protect the Roman Empire? John Hopkins Mag. 2, 70 (1997)
Pushpam, P.R.L., Kamalam, M.: Efficient weak Roman domination in graphs. IJPAM 101(5), 701–710 (2015)
Pushpam, P.R.L., Kamalam, M.: Efficient weak Roman domination in Myscielski graphs. Int. J. Pure Eng. Math. 3(2), 93–100 (2015)
Pushpam, P.R.L., Kamalam, M.: Stability of weak Roman domination upon vertex deletion. Asian J. Math. Comput. Res. 25(2), 97–105 (2018)
Pushpam, P.R.L., Kamalam, M.: Effects of vertex deletion on the weak Roman domination number of a graph. AKCE Int. J. Graphs Comb. 16(2), 204–212 (2019)
Pushpam, P.R.L., Mai, T.N.M.M.: On efficient Roman dominatable graphs. J. Comb. Math. Comput. 67, 49–58 (2008)
Pushpam, P.R.L., Mai, T.N.M.M.: Edge Roman domination in graphs. J. Comb. Math. Comput. 69, 175–182 (2009)
Pushpam, P.R.L., Mai, T.N.M.M.: Weak Roman domination in graphs. Discuss. Math. Graph Theory. 31, 115–128 (2011)
Pushpam, P.R.L., Padmapriea, S.: Restrained Roman domination in graphs. Trans. Comb. 4(1), 1–17 (2015)
Pushpam, P.R.L., Padmapriea, S.: Global Roman domination in graphs. Discrete Appl. Math. 200, 176–185 (2016)
Stewart, I.: Defend the Roman Empire. Sci. Am. 281, 136–139 (1991)
Xu, J.-M.: On bondage numbers of graphs - a survey with some comments. Int. J. Comb. 2013 (2013). 34 pages
Acknowledgement
The authors are thankful to the referees for their valuable suggestions for the improvement of the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Pushpam, P.R.L., Srilakshmi, N. (2020). Weak Roman Bondage Number of a Graph. In: Changat, M., Das, S. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2020. Lecture Notes in Computer Science(), vol 12016. Springer, Cham. https://doi.org/10.1007/978-3-030-39219-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-39219-2_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39218-5
Online ISBN: 978-3-030-39219-2
eBook Packages: Computer ScienceComputer Science (R0)