相关论文: Roman domination in graphs: the class $\mathcal{R}…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

In the domination game, introduced by Bre\v{s}ar, Klav\v{z}ar and Rall in 2010, Dominator and Staller alternately select a vertex of a graph $G$. A move is legal if the selected vertex $v$ dominates at least one new vertex -- that is, if we…

Let $\gamma(G)$ be the domination number of a graph $G$. A graph $G$ is \emph{domination-vertex-critical}, or \emph{$\gamma$-vertex-critical}, if $\gamma(G-v)< \gamma(G)$ for every vertex $v \in V(G)$. In this paper, we show that: Let $G$…

Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. A dominating set $D$ is called a total dominating set if every vertex in $D$ is adjacent to a vertex in $D$.…

A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Let $\gamma(G)$ be the cardinality of a minimum dominating set in $G$. The bondage number $b(G)$ of a graph $G$ is the…

For a graph $G = (V(G), E(G))$, a dominating set $D$ is a vertex subset of $V(G)$ in which every vertex of $V(G) \setminus D$ is adjacent to a vertex in $D$. The domination number of $G$ is the minimum cardinality of a dominating set of $G$…

A dominating set of a graph $G$ is a set of vertices $D$ such that for all $v \in V(G)$, either $v \in D$ or $(v,d) \in E(G)$ for some $d \in D$. The cardinality redundance of a vertex set $S$, $CR(S)$, is the number of vertices in $V(G)$…

The \emph{zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G) \setminus S$ are colored white) such that $V(G)$ is turned black after finitely many applications of…

A signed dominating function of graph $\Gamma$ is a function $g :V(\Gamma) \longrightarrow \{-1,1\}$ such that $\sum_{u \in N[v]}g(u) >0$ for each $v \in V(\Gamma)$. The signed domination number $\gamma_{_S}(\Gamma)$ is the minimum weight…

The $k$-rainbow independent domination number of a graph $G$, denoted $\gamma_{\rm rik}(G)$, is the cardinality of a smallest set consisting of two vertex-disjoint independent sets $V_1$ and $V_2$ for which every vertex in $V(G)\setminus…

A fair dominating set in a graph $G$ (or FD-set) is a dominating set $S$ such that all vertices not in $S$ are dominated by the same number of vertices from $S$; that is, every two vertices not in $S$ have the same number of neighbors in…

The concept of Roman domination has recently been studied concerning enumerating and counting (WG 2022). It has been shown that minimal Roman dominating functions can be enumerated with polynomial delay, contrasting what is known about…

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S$ of vertices of a graph $G$ with no isolated vertices is a…

For any graph $G$ of order $p$, a bijection $f: V(G)\to [1,p]$ is called a numbering of the graph $G$ of order $p$. The strength $str_f(G)$ of a numbering $f: V(G)\to [1,p]$ of $G$ is defined by $str_f(G) = \max\{f(u)+f(v)\; |\; uv\in…

A dominating set of a graph $G$ is a set $D \subseteq V(G)$ such that every vertex in $V(G) \setminus D$ is adjacent to at least one vertex in $D$. A set $L\subseteq V(G)$ is a locating set of $G$ if every vertex in $V(G) \setminus L$ has…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

For a graph $G = (V, E)$ with vertex set $V$ and edge set $E$, a subset $F$ of $E$ is called an $\emph{edge dominating set}$ (resp. a $\emph{total edge dominating set}$) if every edge in $E\backslash F$ (resp. in $E$) is adjacent to at…

A dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex outside $D$ is adjacent to a vertex in $D$. A locating-dominating set of $G$ is a dominating set $D$ of $G$ with the additional property that every two…

The open neighbourhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $D\subseteq V(G)$, we define $\overline{D}=V(G)\setminus D$. A set $D\subseteq V(G)$ is called a super dominating…

Addressing a problem posed by Chellali, Haynes, and Hedetniemi (Discrete Appl. Math. 178 (2014) 27-32) we prove $\gamma_{r2}(G)\leq 2\gamma_r(G)$ for every graph $G$, where $\gamma_{r2}(G)$ and $\gamma_r(G)$ denote the $2$-rainbow…