p-Strong Roman Domination in Graphs

TL;DR

This paper introduces a new graph domination parameter called p-strong Roman domination, analyzes its computational complexity, provides bounds, and calculates exact values for specific graph families.

Contribution

It defines the p-strong Roman domination model, studies its NP-completeness, and derives bounds and exact values for certain graph classes.

Findings

NP-completeness of the p-Strong Roman Domination problem

General upper and lower bounds depending on graph invariants

Exact values for specific families of graphs

Abstract

Domination in graphs is a widely studied field, where many different definitions have been introduced in the last years to respond to different network requirements. This paper presents a new dominating parameter based on the well-known strong Roman domination model. Given a positive integer $p$, we call a $p$-strong Roman domination function ($p$-StRDF) in a graph $G$ to a function $f:V(G)\rightarrow \{0,1,2, \ldots , \left\lceil \frac{\Delta+p}{p} \right\rceil \}$ having the property that if $f(v)=0$, then there is a vertex $u\in N(v)$ such that $f(u) \ge 1+ \left\lceil \frac{ |B_0\cap N(u)|}{p} \right\rceil $, where $B_0$ is the set of vertices with label $0$. The $p$-strong Roman domination number $\gamma_{StR}^p(G)$ is the minimum weight (sum of labels) of a $p$-StRDF on $G$. We study the NP-completeness of the \emph{$p$-StRD}-problem, we also provide general and tight upper and lower bounds depending on several classical invariants of the graph and, finally, we determine the exact values for some families of graphs.