$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$

TL;DR

The results extend and unify known domination-type parameters on grid-like structures and highlight new regularities that emerge as the reinforcement strength increases.

Abstract

Roman domination and its higher-order extensions have attracted considerable attention due to their natural interpretation in terms of defensive resource allocation on networks. The recently introduced $[k]$-Roman domination framework unifies classical Roman, double, triple, and higher-strength protection schemes by allowing each fortified vertex to provide up to $k$ levels of support. In this paper, we investigate the $[k]$-Roman domination number $γ_{[k]R}(G)$ on cylindrical grids $C_m \Box P_n$. We relate $[k]$-Roman domination to efficient domination and show that for efficient graphs one has $γ_{[k]R}(G)=(k+1)γ(G)$; as a consequence, we obtain explicit values for broad families of toroidal grids and determine exactly when the cylindrical graphs $C_m\Box P_n$ admit an efficient dominating set. Building on these structural insights, we derive several upper bounds for $γ_{[k]R}(C_m \Box P_n)$ for small fixed values of $m$, accompanied by explicit labeling patterns that attain these bounds. All obtained bounds are systematically compared, revealing parameter ranges in which different constructions dominate depending on the value of $k$ and the length of the path. In addition, we present exact packing numbers for selected cylindrical graphs, which complement the domination results and enable further refinements via local weight reductions. Our results extend and unify known domination-type parameters on grid-like structures and highlight new regularities that emerge as the reinforcement strength increases.

Figures (5)

• Figure 1: Forced local configurations arising in an attempt to construct an efficient dominating set in $C_m\square P_n$ for $m\ge 4$ and $n>2$.
• Figure 2: Best (smallest) upper bounds among \ref{['L']}--\ref{['S']} for $C_3\Box P_n$ for $1\le k\le 27$.
• Figure 3: A periodic packing pattern in $C_4\Box P_n$ attaining $\lceil \frac{2n}{3}\rceil$. The stars indicate the vertices selected in the packing set in each fibre.
• Figure 4: Best (smallest) upper bounds among \ref{['A']}--\ref{['D']} for $C_4\Box P_n$ for $1\le k\le 20$.
• Figure 5: Best (smallest) upper bounds among \ref{['A']}--\ref{['D']} for $C_4\Box P_n$ for $50\le k\le 61$.

Theorems & Definitions (35)

• Lemma 1: Haynes2023
• Proposition 2
• proof
• Corollary 3
• Theorem 4
• proof
• Corollary 5
• Proposition 6
• proof
• Corollary 7