In 2016, Beeler et al. defined the double Roman domination as a variation of Roman domination. Sometime later, in 2021, Ahangar et al. introduced the concept of [k]-Roman domination in graphs and settled some results on the triple Roman domination case. In 2022, Amjadi et al. studied the quadruple version of this Roman-domination-type problem. Given any labeling of the vertices of a graph, AN(v) stands for the set of neighbors of a vertex v having a positive label. In this paper we continue the study of the [k]-Roman domination functions ([k]-RDF) in graphs which coincides with the previous versions when $$2\le k \le 4$$ . Namely, f is a [k]-RDF if $$f(N[v])\ge k+|AN(v)|$$ for all v. We prove that the associate decision problem is NP-complete even when restricted to star convex and comb convex bipartite graphs and we also give sharp bounds and exact values for several classes of graphs.
Motivated by the original idea of defending the Roman Empire, all these domination concepts can be interpreted as vertex-labeling schemes that model the allocation of resources to protect a graph against attacks. A Roman dominating function (RDF) is a labeling of the vertices of a graph with labels in such that every vertex labeled 0 is adjacent to at least one vertex labeled 2. The weight of an RDF is the sum of all vertex labels. Vertices labeled 2 are intended to protect their neighbors labeled 0. The Roman domination number is the minimum weight of an RDF on the graph. In 2017, Álvarez et al. introduced strong Roman domination as a variant of Roman domination designed to protect the vertices of a graph against multiple simultaneous attacks. In 2021, Ahangar et al. defined -Roman domination, another model intended to defend a graph against individual attacks on vertices. In this paper, we investigate the computational complexity of the associated decision problems for -Roman domination and strong Roman domination. Furthermore, we determine exact values of these parameters for several graph families under both variants.
The Roman domination in graphs is well-studied in graph theory. The topic is related to a defensive strategy problem in which the Roman legions are settled in some secure cities of the Roman Empire. The deployment of the legions around the Empire is designed in such a way that a sudden attack to any undefended city could be quelled by a legion from a strong neighbour. There is an additional condition: no legion can move if doing so leaves its base city defenceless. In this manuscript we start the study of a variant of Roman domination in graphs: the triple Roman domination. We consider that any city of the Roman Empire must be able to be defended by at least three legions. These legions should be either in the attacked city or in one of its neighbours. We determine various bounds on the triple Roman domination number for general graphs, and we give exact values for some graph families. Moreover, complexity results are also obtained.
In this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from to the vertices of a graph such that every vertex is protected by at least three units either on itself or its neighbors while ensuring that none of its neighbors remains unprotected. Formally, a total triple Roman dominating function is a function such that , where denotes the set of active neighbors of vertex v, i.e., those assigned a positive label. We investigate the algorithmic complexity of the associated decision problem, establish sharp bounds regarding graph structural parameters, and obtain the exact values for several graph families.
In this paper, we initiate the study of total triple Roman domination, in which we aim to ensure that each vertex of the graph is protected by at least three units, either located on itself or its neighbors, while guaranteeing that none of its neighbors remain unprotected. Formally, a total triple Roman dominating function is a labeling f of the vertices of the graph with labels {0,1,…,4} such that f(N[v])≥|AN(v)|+3, where AN(v) denotes the set of active neighbors of vertex v, i.e., those assigned a positive label. We investigate the algorithmic complexity of the associated decision problem, establish sharp bounds regarding graph structural parameters, and obtain the exact values for several graph families.