Rights accessRestricted access - publisher's policy
Let GG be a graph and let kk and jj be positive integers. A subset DD of the vertex set of GG is a kk-dominating set if every vertex not in DD has at least kk neighbors in DD. The kk-domination numberγk(G)γk(G) is the cardinality of a smallest kk-dominating set of GG. A subset I⊆V(G)I⊆V(G) is a jj-independent set of GG if every vertex in II has at most j−1j−1 neighbors in II. The jj-independence numberαj(G)αj(G) is the cardinality of a largest jj-independent set of GG. In this work, we study the interaction between γk(G)γk(G) and αj(G)αj(G) in a graph GG. Hereby, we generalize some known inequalities concerning these parameters and put into relation different known and new bounds on kk-domination and jj-independence. Finally, we will discuss several consequences that follow from the given relations, while always highlighting the symmetry that exists between these two graph invariants.
CitationHansberg, A.; Pepper, R. On k-domination and j-independence in graphs. "Discrete applied mathematics", Juliol 2013, vol. 161, núm. 10-11, p. 1472-1480.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org