Bounds on the <Emphasis Type="Italic">k</Emphasis>-tuple domatic number of a graph |
| |
Authors: | Lutz Volkmann |
| |
Institution: | 1.Lehrstuhl II für Mathematik,RWTH Aachen University,Aachen,Germany |
| |
Abstract: | Let k be a positive integer, and let G be a simple graph with vertex set V (G). A vertex of a graph G dominates itself and all vertices adjacent to it. A subset S ⊆ V (G) is a k-tuple dominating set of G if each vertex of V (G) is dominated by at least k vertices in S. The k-tuple domatic number of G is the largest number of sets in a partition of V (G) into k-tuple dominating sets. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|