๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithmic aspects of k-tuple total domination in graphs

โœ Scribed by D. Pradhan

Book ID
116577152
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
228 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

k-tuple domination in graphs
k-tuple domination in graphs
โœ Chung-Shou Liao; Gerard J. Chang ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 109 KB
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