相关论文: On General Frameworks and Threshold Functions for …

Let $k \in \mathbb{N}$ and let $G$ be a graph. A function $f: V(G) \rightarrow 2^{[k]}$ is a rainbow function if, for every vertex $x$ with $f(x)=\emptyset$, $f(N(x)) =[k]$. The rainbow domination number $\gamma_{kr}(G)$ is the minimum of…

Let $G$ be a finite simple graph with vertex set $V(G)$ and edge set $E(G)$. A function $f : V(G) \rightarrow \mathcal{P}(\{1, 2, \dotsc, k\})$ is a \textit{$k$-rainbow dominating function} on $G$ if for each vertex $v \in V(G)$ for which…

We study the Nordhaus-Gaddum type results for $(k-1,k,j)$ and $k$-domination numbers of a graph $G$ and investigate these bounds for the $k$-limited packing and $k$-total limited packing numbers in graphs. As the special case…

In a graph $G$, a vertex dominates itself and its neighbors. A subset $S$ of vertices of $G$ is a double dominating set of $G$ if every vertex is dominated by at least two vertices in $S$. The double domination number $\gamma_{\times 2}(G)$…

The aim of this work is to investigate the nonnegative signed domination number $\gamma^{NN}_s$ with emphasis on regular, ($r+1$)-clique-free graphs and trees. We give lower and upper bounds on $\gamma^{NN}_s$ for regular graphs and prove…

Let $F_1, F_2, ..., F_k$ be graphs with the same vertex set $V$. A subset $S \subseteq V$ is a simultaneous dominating set if for every $i$, $1 \le i \le k$, every vertex of $F_i$ not in $S$ is adjacent to a vertex in $S$ in $F_i$; that is,…

The $(t,r)$ broadcast domination number of a graph $G$, $\gamma_{t,r}(G)$, is a generalization of the domination number of a graph. $\gamma_{t,r}(G)$ is the minimal number of towers needed, placed on vertices of $G$, each transmitting a…

We extend the classical Titchmarsh theorems to the Fourier transform of two types of H\"older-Lipschitz functions - additive and multiplicative - defined on fundamental domains of lattices in $\mathbb{R}^d$. Our approach is based on…

The technique of sparse domination, i.e., dominating operators with sums of averages taken over sparsely distributed cubes, has seen rapid development recently within the realms of harmonic analysis. A useful extension of sparse domination…

The Grundy domination number of a graph $G = (V,E)$ is the length of the longest sequence of unique vertices $S = (v_1, \ldots, v_k)$ satisfying $N[v_i] \setminus \cup_{j=1}^{i-1}N[v_j] \neq \emptyset$ for each $i \in [k]$. Recently, a…

Let $1 \leq k \leq n$ be a positive integer. A {\em nonnegative signed $k$-subdominating function} is a function $f:V(G) \rightarrow \{-1,1\}$ satisfying $\sum_{u\in N_G[v]}f(u) \geq 0$ for at least $k$ vertices $v$ of $G$. The value…

A set of vertices $W$ of a graph $G$ is a total $k$-dominating set when every vertex of $G$ has at least $k$ neighbors in $W$. In a recent article, Chiarelli et al.\ (Improved Algorithms for $k$-Domination and Total $k$-Domination in Proper…

The \textsc{Dominating Set} problem is a classical and extensively studied topic in graph theory and theoretical computer science. In this paper, we examine the algorithmic complexity of several well-known exact-distance variants of…

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…

We prove that for every graph $G$ on $n$ vertices and with minimum degree five, the domination number $\gamma(G)$ cannot exceed $n/3$. The proof combines an algorithmic approach and the discharging method. Using the same technique, we…

Let $D=(V,A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v\in V-S$, there exists vertices $u_1,u_2 \in S$ such that $(v,u_1)$ and $(u_2,v)$ are arcs in $D$. The minimum cardinality of a…

We begin by defining functions $\sigma_{t,k}$, which are generalized divisor functions with restricted domains. For each positive integer $k$, we show that, for $r>1$, the range of $\sigma_{-r,k}$ is a subset of the interval…

Two new techniques are introduced into the theory of the domination game. The cutting lemma bounds the game domination number of a partially dominated graph with the game domination number of suitably modified partially dominated graph. The…

In this paper we determine the exact values of the signed domination number, signed total domination number, and minus domination number of complete multipartite graphs, which substantially generalizes some previous results obtained for…

We briefly review known results on upper bounds for the minimal domination number $\gamma_n$ of a hypercube of dimension $n$, then present a new method for constructing dominating sets. Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq…