相关论文: Independent Double Roman Domination on Block Graph…

Consider a graph $G = (V, E)$ and a function $f: V \rightarrow \{0, 1, 2\}$. A vertex $u$ with $f(u)=0$ is defined as \emph{undefended} by $f$ if it lacks adjacency to any vertex with a positive $f$-value. The function $f$ is said to be a…

A total Roman dominating function on a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ is adjacent to some vertex $u$ with $f(u)=2$, and the subgraph of $G$ induced by the set of all vertices…

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…

A double Roman Dominating function on a graph $G$ is a function $ f:V\rightarrow \{0,1,2,3\}$ such that the following conditions hold. If $f(v)=0$, then vertex $v$ must have at least two neighbors in $V_2$ or one neighbor in $V_3$ and if…

In this paper, an upper bound for the perfect Italian domination number of the cartesian product of any two graphs is obtained and the exact value of this parameter for cartesian product of some special graphs are obtained. We have also…

Given a graph $G$ without isolated vertices, a total Roman dominating function for $G$ is a function $f : V(G)\rightarrow \{0,1,2\}$ such that every vertex with label 0 is adjacent to a vertex with label 2, and the set of vertices with…

For a function $f : V(G ) \rightarrow \{0, 1, 2\}$ we denote by $V_i$ the set of vertices to which the value $i$ is assigned by $f$, i.e. $V_i = \{ x \in V (G ) : f(x ) = i \}$. If a function $f: V(G) \rightarrow \{0,1,2\}$ satisfying the…

A vertex subset $W\subseteq V$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. The independent…

A vertex $v$ of a graph $G=(V,E)$ is said to be undefended with respect to a function $f: V \longrightarrow \{0,1,2\}$ if $f(v)=0$ and $f(u)=0$ for every vertex $u$ adjacent to $v$. We call the function $f$ a weak Roman dominating function…

We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double Roman dominating function (RDRD function) if the subgraph…

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…

Let $\{0,1,\dots, t\}$ be abbreviated by $[t].$ A double Roman dominating function (DRDF) on a graph $\Gamma=(V,E)$ is a map $l:V\rightarrow [3]$ satisfying \textrm{(i)} if $l(r)=0$ then there must be at least two neighbors labeled 2 under…

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathcal{I}(G)$, is the graph whose vertices correspond to the…

For a positive integer $k$, a $\{k\}$-Roman dominating function of a graph $G = (V,E)$ is a function $f\colon V \rightarrow \{0,1,\ldots,k\}$ satisfying $f (N(v)) \geq k$ for each vertex $v\in V$ with $f (v) = 0$. Every graph $G$ satisfies…

A total Roman dominating function on a graph $G$ is a function $% f:V(G)\rightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ is adjacent to some vertex $u$ with $f(u)=2$, and the subgraph of $G$ induced by the set of all vertices…

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…

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 edge Roman dominating function of a graph $G$ is a function $f\colon E(G) \rightarrow \{0,1,2\}$ satisfying the condition that every edge $e$ with $f(e)=0$ is adjacent to some edge $e'$ with $f(e')=2$. The edge Roman domination number of…

A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\left\{ 1,2,\ldots ,n\right\} $ to the vertices of $G$. The strength $\textrm{str}_{f}\left( G\right)$ of a numbering $f:V\left( G\right)…

An edge dominating set $F$ of a graph $G=(V,E)$ is an \textit{edge cut dominating set} if the subgraph $\langle V,G-F \rangle$ is disconnected. The \textit{edge cut domination number} $\gamma_{ct}(G)$ of $G$ is the minimum cardinality of an…