Signed double Roman domination on cubic graphs

Enrico Iurlano, Tatjana Zec, Marko Djukanovic and Günther R. Raidl

Applied Mathematics and Computation, 2024, vol. 471, issue C

Abstract: The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from {±1,2,3} to each vertex feasibly, such that the total sum of assigned labels is minimized. Here feasibility is given whenever (i) vertices labeled ±1 have at least one neighbor with label in {2,3}; (ii) each vertex labeled −1 has one 3-labeled neighbor or at least two 2-labeled neighbors; and (iii) the sum of labels over the closed neighborhood of any vertex is positive. The cumulative weight of an optimal labeling is called signed double Roman domination number (SDRDN). In this work, we first consider the problem on general cubic graphs of order n for which we present a sharp n/2+Θ(1) lower bound for the SDRDN by means of the discharging method. Moreover, we derive a new best upper bound. Observing that we are often able to minimize the SDRDN over the class of cubic graphs of a fixed order, we then study in this context generalized Petersen graphs for independent interest, for which we propose a constraint programming guided proof. We then use these insights to determine the SDRDNs of subcubic 2×m grid graphs, among other results.

Keywords: Signed double Roman domination; Cubic graphs; Discharging method; Generalized Petersen graphs (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324000845
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:471:y:2024:i:c:s0096300324000845

DOI: 10.1016/j.amc.2024.128612

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().