Author:
Abd Aziz Noor A’lawiah,Jafari Rad Nader,Kamarulhaili Hailiza
Abstract
Kammerling and Volkmann [J. Korean Math. Soc. 46 (2009) 1309–1318] introduced the concept of Roman κ-domination in graphs. For a fixed positive integer κ, a function f : V(G) → {0, 1, 2} is a Roman κ-dominating function on G if every vertex valued 0 under f is adjacent to at least κ vertices valued 2 under f. In this paper, inspired by the concept of alliances in graphs, we revisit the concept of Roman κ-domination by not-fixing κ. We prove upper bounds for the new variant in cactus graphs and characterize cactus graph achieving equality for the given bound. We also present a probabilistic upper bound for this variant.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference21 articles.
1. Alon N. and Spencer J., The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (2000).
2. Extremal Problems for Roman Domination
3. Chellali M., Jafari Rad N., Sheikholeslami S.M. and Volkmann L., Roman domination in graphs, in Topics in Domination in Graphs. Developments in Mathematics, edited by Haynes T.W., Hedetniemi S.T. and Henning M.A.. Vol. 64. Springer, Cham (2020).
4. Chellali M., Jafari Rad N., Sheikholeslami S.M. and Volkmann L., Varieties of Roman domination, in Structures of Domination in Graphs, edited by Haynes T.W., Hedetniemi S.T. and Henning M.A.. Springer (2020).
5. Varieties of Roman domination II