Related papers: A note on double domination in graphs

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…

A graph $G$ is a \emph{cover} of a graph $F$ if there exists an onto mapping $\pi : V(G) \to V(F)$, called a (\emph{covering}) \emph{projection}, such that $\pi$ maps the neighbours of any vertex $v$ in $G$ bijectively onto the neighbours…

We introduce a domination polynomial of a graph G. The domination polynomial of a graph G of order n is the polynomial D(G, x) =\sum_{i=1}^n d(G, i)x^i, where d(G, i) is the number of dominating sets of G of size i. We obtain some…

Let $G=(V,E)$ be a graph. For some $\alpha$ with $0<\alpha \leq 1$, a subset $S$ of $V$ is said to be a $\alpha$-partial dominating set if $|N[S]|\geq \alpha |V|$. The size of a smallest such $S$ is called the $\alpha$-partial domination…

In this article, we present a new method to study uniqueness of form extensions in a rather general setting. The method is based on the theory of ordered Hilbert spaces and the concept of domination of semigroups. Our main abstract result…

As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that…

We consider two graph optimization problems called vector domination and total vector domination. In vector domination one seeks a small subset S of vertices of a graph such that any vertex outside S has a prescribed number of neighbors in…

The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total…

In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular,…

Let $G=(V,E)$ be a graph without isolated vertices. A set $S\subseteq V$ is a paired-domination set if every vertex in $V-S$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ contains a perfect matching. The paired-domination…

The domination polynomials of binary graph operations, aside from union, join and corona, have not been widely studied. We compute and prove recurrence formulae and properties of the domination polynomials of families of graphs obtained by…

Let $G$ be a graph with minimum degree at least 2. A set $D\subseteq V$ is a double total dominating set of $G$ if each vertex is adjacent to at least two vertices in $D$. The double total domination number $\gamma _{\times 2,t}(G)$ of $G$…

$k$-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on vertices of cardinality bounded by a parameter $k$. The problem…

This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…

We study a variant of domination, called Roman domination, where we must assign to each vertex one of the labels 0, 1, or 2 and require that every vertex with label 0 has a neighbour with label 2. We study the problem of finding a low-cost…

We improve recent results relating graph eigenvalues to other graph parameters like girth, domination number, and minimum degree.

We show that the domination number of the binomial random graph G_{n,p} with edge-probability p is concentrated on two values for p \ge n^{-2/3+\eps}, and not concentrated on two values for general p \le n^{-2/3}. This refutes a conjecture…

A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of…

We propose new bounds on the domination number and on the independence number of a graph and show that our bounds compare favorably to recent ones. Our bounds are obtained by using the Bhatia-Davis inequality linking the variance, the…

In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph $G$, called the sub-$k$-domination number and denoted $sub_k(G)$. We show that $sub_k(G)$ is a computationally efficient sharp lower…