Bounds for (strong) Roman $k$-dominations

Abstract

Motivated by resource defense models in networks, such as protecting territories with varying legion strengths, let $k\ge 2$ be an integer. Roman $k$-domination and strong Roman $k$-domination generalize Roman, double Roman, Italian, and double Italian domination to arbitrary number of legions. The main goal of this note is establishing sharp upper bounds for the Roman and strong Roman $k$-domination numbers of connected graphs. These bounds unify and extend prior results for $k=2$ and $k=3$. We also precisely characterize the graphs achieving these bounds.

13 Pages, To appear in "Discrete Mathematics"