相关论文: Minimal Roman Dominating Functions: Extensions and…

Given a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2,3\}$ having the property that if $f(v)=0$, then there exist $ v_{1},v_{2}\in N(v)$ such that $f(v_{1})=f(v_{2})=2$ or there exists $ w \in N(v)$ such that $f(w)=3$, and if…

Roman domination is a well researched topic in graph theory. Recently two new variants of Roman domination, namely triple Roman domination and quadruple Roman domination problems have been introduced, to provide better defense strategies.…

Given a graph $G=(V,E)$, $f:V \rightarrow \{0,1,2 \}$ is the Italian dominating function of $G$ if $f$ satisfies $\sum_{u \in N(v)}f(u) \geq 2$ when $f(v)=0$. Denote $w(f)=\sum_{v \in V}f(v)$ as the weight of $f$. Let…

Given a graph $G = (V, E)$, a signed Roman dominating function is a function $f: V \rightarrow \{-1, 1, 2\}$ such that for every vertex $u \in V$: $\sum_{v \in N[u]} f(v) \geq 1$ and for every vertex $u \in V$ with $f(u) = -1$, there exists…

In this paper, we study the $[k]$-Roman domination number of cylindrical graphs $C_m \Box P_n$. Our analysis begins with a general lower bound based on local neighborhood constraints, showing that $\gamma_{[k]R}(C_m\Box P_n) >…

For a graph $G$, let $\gamma_R(G)$ and $\gamma_{r2}(G)$ denote the Roman domination number of $G$ and the $2$-rainbow domination number of $G$, respectively. It is known that $\gamma_{r2}(G)\leq \gamma_R(G)\leq \frac{3}{2}\gamma_{r2}(G)$.…

Let $G=(V, E)$ be a simple and undirected graph. For some integer $k\geq 1$, a set $D\subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has at least $k$ neighbors in $D$. Furthermore, for some real…

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…

A dominating set $D$ of a graph $G$ is a set of vertices such that any vertex in $G$ is in $D$ or its neighbor is in $D$. Enumeration of minimal dominating sets in a graph is one of central problems in enumeration study since enumeration of…

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…

Let $G=(V,E)$ be a finite connected simple graph with vertex set $V$ and edge set $E$. A signed Roman dominating function (SRDF) on a graph $G$ is a function $f: V \rightarrow \{-1, 1, 2\}$ that satisfies two conditions: (i) $\sum_{y\in…

An independent double Roman dominating function (IDRDF) on a graph $G=(V,E)$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ having the property that if $f(v)=0$, then the vertex $v$ has at least two neighbors assigned $2$ under $f$ or one…

One of the well-known measurements of vulnerability in graph theory is domination. There are many kinds of dominating and relative types of sets in graphs. However, we are going to focus on Roman domination, which is a type of domination…

Enumerating minimal transversals in a hypergraph is a notoriously hard problem. It can be reduced to enumerating minimal dominating sets in a graph, in fact even to enumerating minimal dominating sets in an incomparability graph. We provide…

An \textit{Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function $f : V(D) \rightarrow \{0, 1, 2\}$ such that every vertex $v \in V(D)$ with $f(v) = 0$ has at least two in-neighbors assigned $1$ under…

By providing a new framework, we extend previous results on locally checkable problems in bounded treewidth graphs. As a consequence, we show how to solve, in polynomial time for bounded treewidth graphs, double Roman domination and Grundy…

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…

Let $G=(V,E)$ be a graph. A subset $D$ of $V$ is a \textit{restrained dominating set} if every vertex in $V \setminus D$ is adjacent to a vertex in $D$ and to a vertex in $V \setminus D$. The \textit{restrained domination number}, denoted…

A set $D\subseteq V$ of a graph $G=(V,E)$ is called a restrained dominating set of $G$ if every vertex not in $D$ is adjacent to a vertex in $D$ and to a vertex in $V \setminus D$. The \textsc{Minimum Restrained Domination} problem is to…

For a graph $G$, let $\gamma_{r2}(G)$ and $\gamma_R(G)$ denote the $2$-rainbow domination number and the Roman domination number, respectively. Fujita and Furuya (Difference between 2-rainbow domination and Roman domination in graphs,…