Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_m \Box P_n$
Simon Brezovnik, Janez \v{Z}erovnik

TL;DR
This paper investigates the $[k]$-Roman domination number of cylindrical grids, deriving new upper bounds through constructive techniques and analyzing their efficiency depending on parameters and graph sizes.
Contribution
It introduces unified upper bounds for cylindrical grids' $[k]$-Roman domination numbers using multiple innovative construction methods.
Findings
Explicit bounds for $C_9\Box P_n$ depending on $k$
Unified upper bounds for $C_{rt}\Box P_n$ with $r$ multiple of 3 to 9
Residue-class bounds outperform for large circumferences
Abstract
Roman-type domination parameters form an important class of graph invariants that model protection and resource allocation problems on networks. Among them, -Roman domination provides a unified framework that generalizes Roman, double Roman, and higher-order variants. In this paper we investigate the -Roman domination number of cylindrical grids and derive several new constructive upper bounds. Our approach combines three complementary techniques: linear periodic constructions, uniform ceiling-type labelings, and packing-based refinements. We first analyze the case , where these three families of bounds can be compared explicitly and their relative efficiency is shown to depend on the parameter . We then extend the linear constructions to cylindrical grids whose circumference is a multiple of one of the values , obtaining a unified…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
