Multiple domination
A Hansberg, L Volkmann - Topics in domination in graphs, 2020 - Springer
Let G be a graph and let D be a subset of its vertex set. D is called k-dominating if| N (v)∩
D|≥ k for all v∈ V (G)∖ D; D is called k-tuple dominating if| N v∩ D|≥ k for all v∈ V (G); and …
D|≥ k for all v∈ V (G)∖ D; D is called k-tuple dominating if| N v∩ D|≥ k for all v∈ V (G); and …
Bipartite graphs with close domination and k-domination numbers
Let k be a positive integer and let G be a graph with vertex set V (G). A subset D⊆ V (G) is ak-
dominating set if every vertex outside D is adjacent to at least k vertices in D. The k …
dominating set if every vertex outside D is adjacent to at least k vertices in D. The k …