On (k,l)-kernels in D-join of digraphs
Waldemar Szumny, Andrzej Włoch, Iwona Włoch (2007)
Discussiones Mathematicae Graph Theory
Similarity:
In [5] the necessary and sufficient conditions for the existence of (k,l)-kernels in a D-join of digraphs were given if the digraph D is without circuits of length less than k. In this paper we generalize these results for an arbitrary digraph D. Moreover, we give the total number of (k,l)-kernels, k-independent sets and l-dominating sets in a D-join of digraphs.