相关论文: Further results on \([k]\)-Roman domination on cyl…
Roman domination and its higher-order extensions have attracted considerable attention due to their natural interpretation in terms of defensive resource allocation on networks. The recently introduced $[k]$-Roman domination framework…
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…
We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs of the form $C_n\square P_m$, that is, the Cartesian product of a cycle $C_n$ and a path $P_m$, for $m$ and $n$ sufficiently…
The Roman domination in a graph $G$ is a variant of the classical domination, defined by means of a so-called Roman domination function $f\colon V(G)\to \{0,1,2\}$ such that if $f(v)=0$ then, the vertex $v$ is adjacent to at least one…
We use a dynamic programming algorithm to establish a new lower bound on the domination number of complete cylindrical grid graphs of the form $C_n\square P_m$, that is, the Cartesian product of a path and a cycle, when $n\equiv 2\pmod{5}$,…
This paper considers the following three Roman domination graph invariants on Kneser graphs: Roman domination, total Roman domination, and signed Roman domination. For Kneser graph $K_{n,k}$, we present exact values for Roman domination…
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…
Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a "stronger" neighbor place (having two legions), a graph theoretical model called Roman…
Let $G=(V,E)$ be a graph of order $n$ and let $\gamma _{R}(G)$ and $\partial (G)$ denote the Roman domination number and the differential of $G,$ respectively. In this paper we prove that for any integer $k\geq 0$, if $G$ is a graph of…
Motivated by resource defense models in networks, such as protecting territories with varying legion strengths, let $k \geq 2$ be an integer. Roman $k$-domination and strong Roman $k$-domination generalize Roman, double Roman, Italian, and…
We investigate the 2-domination number for grid graphs, that is the size of a smallest set $D$ of vertices of the grid such that each vertex of the grid belongs to $D$ or has at least two neighbours in $D$. We give a closed formula giving…
In this paper we present a lower bound for the domination number of the Cartesian product of a path and a cycle, that is tight if the length of the cycle is a multiple of five. This bound improves the natural lower bound obtained by using…
In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we give upper bounds for the restrained domination and total…
Given a function $f\colon V(G) \to \mathbb{Z}_{\geq 0}$ on a graph $G$, $AN(v)$ denotes the set of neighbors of $v \in V(G)$ that have positive labels under $f$. In 2021, Ahangar et al.~introduced the notion of $[k]$-Roman Dominating…
A $Roman\ domination\ function$ on a graph $G=(V, E)$ is a function $f:V(G)\rightarrow\{0,1,2\}$ satisfying the condition that every vertex $u$ with $f(u)=0$ is adjacent to at least one vertex $v$ with $f(v)=2$. The $weight$ of a Roman…
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized. Here feasibility…
The concept of Roman domination has been a subject of intrigue for more than two decades with the fundamental Roman domination problem standing out as one of the most significant challenges in this field. This article studies a practically…
Domination-type parameters are difficult to manage in Cartesian product graphs and there is usually no general relationship between the parameter in both factors and in the product graph. This is the situation of the domination number, the…
Given a graph $G=(V,E)$, the dominating number of a graph is the minimum size of a vertex set, $V' \subseteq V$, so that every vertex in the graph is either in $V'$ or is adjacent to a vertex in $V'$. A Roman Dominating function of $G$ is…
This work is related to the extension of the well-known problem of Roman domination in graph theory to fuzzy graphs. A variety of approaches have been used to explore the concept of domination in fuzzy graphs. This study uses the concept of…