Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_m\Box P_n$
Authors:ID Brezovnik, Simon (Author)
ID Žerovnik, Janez (Author)
Files:.pdf PDF - Presentation file, download (857,23 KB)
MD5: C45D7681A115BE40BF5E8434A5F0B747
 
URL URL - Source URL, visit https://www.mdpi.com/2075-1680/15/5/382
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Logo RUDOLFOVO - Rudolfovo - Science and Technology Centre Novo Mesto
Abstract:Roman-type domination parameters form an important class of graph invariants that model protection and resource allocation problems on networks. Among them, $[k]$-Roman domination provides a unified framework that generalizes Roman, double Roman, and higher-order variants. In this paper we investigate the $[k]$-Roman domination number of cylindrical grids $C_m\Box P_n$ 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 $C_9\Box P_n$, where these three families of bounds can be compared explicitly and their relative efficiency is shown to depend on the parameter $k$. We then extend the linear constructions to cylindrical grids whose circumference is a multiple of one of the values $r \in 3,\dots,9$, obtaining a unified family of upper bounds for $C_{rt}\Box P_n$. Motivated by the asymptotic behavior of these estimates, we further derive general upper bounds depending only on the residue class of $m$ modulo $5$, which apply to all cylindrical grids. As a consequence, we obtain explicit estimates for the double Roman domination number $\gamma_{[2R]}(C_m\Box P_n)$ and compare the resulting multiple-based constructions with the residue-class bounds. This comparison shows that the residue-class construction becomes asymptotically superior for all sufficiently large admissible circumferences, while several exceptional small cases remain better covered by tailored constructions.
Keywords:[k]-Roman domination, double Roman domination, cylindrical grids, Cartesian product of graphs
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2026
Year of publishing:2026
Number of pages:27 str.
Numbering:Vol. 15, iss. 5, [article no.] 382
PID:20.500.12556/DiRROS-29629 New window
UDC:519.17
ISSN on article:2075-1680
DOI:10.3390/axioms15050382 New window
COBISS.SI-ID:279071491 New window
Note:
Publication date in DiRROS:01.06.2026
Views:38
Downloads:21
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Axioms
Shortened title:Axioms
Publisher:MDPI
ISSN:2075-1680
COBISS.SI-ID:519951897 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-70016
Name:Sodobne topološke mere za molekulske grafe in omrežja

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P2-0248
Name:Inovativni izdelovalni sistemi in procesi

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:L1-60136
Name:Kvantni reševalnik za težke binarne kvadratične probleme (QBIQ)

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:[k]-rimska dominacija, dvojna rimska dominacija, cilindrični grafi, kartezični produkt grafov


Back