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

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…

A Roman dominating function on a graph $G=(V,E)$ is a function $f:V\rightarrow\{0,1,2\}$ such that every vertex $v\in V$ with $f(v)=0$ has at least one neighbor $u\in V$ with $f(u)=2$. The weight of a Roman dominating function is the value…

A set $S$ of vertices of a graph $G$ is a dominating set for $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. The minimum cardinality of a dominating set for $G$ is called the domination number of $G$.…

A Roman dominating function on a graph $G=(V,E)$ is a function $f: V\to \{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 dominating function…

Consider a finite and simple graph $G=(V,E)$ with maximum degree $\Delta$. A strong Roman dominating function over the graph $G$ is understood as a map $f : V (G)\rightarrow \{0, 1,\ldots , \left\lceil \frac{\Delta}{2}\right\rceil+ 1\}$…

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…

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…

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…

We consider the 2-limited packing problem: for a graph $G=(V,E)$ one seeks to find a maximum cardinality subset $B\subseteq V$, such that, for all $v\in V$, the closed neighbourhood of $v$ contains at most two vertices in $B$. We compare…

A map $f : V \rightarrow \{0, 1, 2\}$ is a Roman dominating function on a graph $G=(V,E)$ if for every vertex $v\in V$ with $f(v) = 0$, there exists a vertex $u$, adjacent to $v$, such that $f(u) = 2$. The weight of a Roman dominating…

A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V \rightarrow \{0, 1, 2\}$ such that every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = \Sigma_{v\in V} f(v)$. The…

For a graph $G=(V,E)$ of order $n$, a Roman $\{2\}$-dominating function $f:V\rightarrow\{0,1,2\}$ has the property that for every vertex $v\in V$ with $f(v)=0$, either $v$ is adjacent to a vertex assigned $2$ under $f$, or $v$ is adjacent…

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 Roman dominating function on a graph $G$ is a labeling $f : V(G) \rightarrow \{0, 1, 2\}$ such that every vertex with label $0$ has a neighbor with label $2$. The Roman domination number, $\gamma_R(G)$, of $G$ is the minimum of…

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…

A dominating set $D$ in a graph is a subset of its vertex set such that each vertex is either in $D$ or has a neighbour in $D$. In this paper, we are interested in the enumeration of (inclusion-wise) minimal dominating sets in graphs,…

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…

The Roman dominating function on a graph $G=(V,E)$ is a function $f: V\rightarrow\{0,1,2\}$ such that each vertex $x$ with $f(x)=0$ is adjacent to at least one vertex $y$ with $f(y)=2$. The value $f(G)=\sum\limits_{u\in V(G)} f(u)$ is…

A double Roman dominating function of a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ having the property that for each vertex $v$ with $f(v)=0$, there exists $u\in N(v)$ with $f(u)=3$, or there are $u,w\in N(v)$ with…

A Roman $\{3\}$-dominating function on a graph $G = (V, E)$ is a function $f: V \rightarrow \{0, 1, 2, 3\}$ such that for each vertex $u \in V$, if $f(u) = 0$ then $\sum_{v \in N(u)} f(v) \geq 3$ and if $f(u) = 1$ then $\sum_{v \in N(u)}…