Apr 8, 2011 · For a positive integer k, a subset S of vertices in a graph G = (V, E) is k-dominating if every vertex of V − S is adjacent to at least k ...

A subset S of vertices in a graph G = (V, E) is k-dominating if every vertex of V − S is adjacent to at least k vertices in S.

In 1985, Fink and Jacobson gave a generalization of the concepts of domination and independence in graphs. For a positive integer k, a subset S of vertices ...

k-Domination and k-Independence in Graphs: A Survey. Language: English ... In this paper we survey results on k-domination and k-independence.

A subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree less than k. The minimum and maximum cardinalities of a ...

Oct 22, 2024 · For a positive integer k, a subset S of vertices in a graph G=(V,E) is k-dominating if every vertex of V-S is adjacent to at least k vertices in ...

Apr 8, 2011 · Theorems 24 and 25 give an upper bound for the k-domination number in terms of the independence number for general graphs and r-partite graphs.

This paper surveys results on k-domination and k-independence in graphs with positive integer k. In 1985, Fink and Jacobson gave a generalization of the ...

In this work, we study the interaction between and in a graph. Hereby, we generalize some known inequalities concerning these parameters.

A subset S of vertices of a graph G is k-dominating if every vertex not in S has at least k neighbours in S. The k-domination number γ k (G) is the minimum ...