✦ LIBER ✦

k-tuple domination in graphs

✍ Scribed by Chung-Shou Liao; Gerard J. Chang

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 109 KB
Volume: 87
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(03)00233-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On -tuple domination of random graphs

✍ Bin Wang; Kai-Nan Xiang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 390 KB

In graph G = (V , E), a vertex set D ⊆ V is called a domination set if any vertex u ∈ V \ D is connected to at least one vertex in D. Generally, for any natural number k, the k-tuple The k-tuple domination number is the minimum size of k-tuple domination sets. It is known that the 1-tuple dominatio

The k-tuple domination number revisited

✍ Vadim Zverovich 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 183 KB

The following fundamental result for the domination number γ (G) of a graph G was proved by Alon and Spencer, Arnautov, Lovász and Payan: where n is the order and δ is the minimum degree of vertices of G. A similar upper bound for the double domination number was found by Harant and Henning [J. Har

Proof of a conjecture on -tuple dominati

Proof of a conjecture on -tuple domination in graphs

✍ Guangjun Xu; Liying Kang; Erfang Shan; Hong Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Let G = (V, E) be a graph and N G [v] the closed neighborhood of a vertex v in G. For k ∈ N, the minimum cardinality of a set In this note we prove the following conjecture of Rautenbach and Volkmann [D. Rautenbach, L. Volkmann, New bounds on the k-domination number and the k-tuple domination numbe

On k-domination and minimum degree in gr

On k-domination and minimum degree in graphs

✍ Odile Favaron; Adriana Hansberg; Lutz Volkmann 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract A subset __S__ of vertices of a graph __G__ is __k__‐dominating if every vertex not in __S__ has at least __k__ neighbors in __S__. The __k__‐domination number $\gamma\_k(G)$ is the minimum cardinality of a __k__‐dominating set of __G__. Different upper bounds on $\gamma\_{k}(G)$ are kn

Generalized k-tuple colorings of cycles

Generalized k-tuple colorings of cycles and other graphs

✍ R.C Brigham; R.D Dutton 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 213 KB

The diameter of domination k-critical gr

The diameter of domination k-critical graphs

✍ Odile Favaron; David P. Sumner; Ewa Wojcicka 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 525 KB

## Abstract A graph is __k__‐domination‐critical if γ(__G) = k__, and for any edge __e__ not in __G__, γ(__G + e) = k__ − 1. In this paper we show that the diameter of a domination __k__‐critical graph with __k__ ≧ 2 is at most 2__k__ − 2. We also show that for every __k__ ≧ 2, there is a __k__‐dom