相关论文: Italian domination in rooted product graphs

A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the…

Given a graph and an integer $k$, it is an NP-complete problem to decide whether there is a dominating set of size at most $k$. In this paper we study this problem for the Kn\"odel Graph on $n$ vertices using elementary number theory…

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…

The upper and lower Nordhaus-Gaddum bounds over all graphs for the power domination number follow from known bounds on the domination number and examples. In this note we improve the upper sum bound for the power domination number…

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…

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…

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

Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence…

The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph $G=(V,E)$, a dominating set of $G$ is a subset $S\subseteq V$ such that every vertex in $…

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…

The {\em independent domination number} $\gamma^i(G)$ of a graph $G$ is the maximum, over all independent sets $I$, of the minimal number of vertices needed to dominate $I$. It is known \cite{abz} that in chordal graphs $\gamma^i$ is equal…

In this paper, we provide a new upper bound for the alpha-domination number. This result generalises the well-known Caro-Roditty bound for the domination number of a graph. The same probabilistic construction is used to generalise another…

Let $G$ be a simple graph with $m$ edges and $H_i$, $1\leq i \leq m$ be simple graphs too. The generalized edge corona product of graphs $G$ and $H_1, ..., H_m$, denoted by $G \diamond (H_1, ..., H_m)$, is obtained by taking one copy of…

In this paper we determine the signed Roman domination number of the join of cycles, wheels, fans and friendship graphs.

A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those sets of vertices of a graph satisfying…

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…

In this note, we generalize the concepts of (perfect) Roman and Italian dominations to (perfect) strong Roman and Roman k-domination for arbitrary positive integer k. These generalizations cover some of previous ones. After some comparison…

In this paper we deal with the calculation of the signed (total) Roman domination numbers, $\gamma_{sR}$ and $\gamma_{stR}$ respectively, on a few classes of planar graphs from the literature. We give proofs for the exact values of the…

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…

We propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage…