2007
DOI: 10.7151/dmgt.1373
|View full text |Cite
|
Sign up to set email alerts
|

On (k,l)-kernels in D-join of digraphs

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
3
0
5

Year Published

2011
2011
2021
2021

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 4 publications
0
3
0
5
Order By: Relevance
“…Native advertising terbagi menjadi tiga kategori; Sponsored Content, Sponsored Hyperlink Listings, dan Sponsored Social Media Posts (Wojdynski, 2016a).…”
Section: Pendahuluanmentioning
confidence: 99%
See 2 more Smart Citations
“…Native advertising terbagi menjadi tiga kategori; Sponsored Content, Sponsored Hyperlink Listings, dan Sponsored Social Media Posts (Wojdynski, 2016a).…”
Section: Pendahuluanmentioning
confidence: 99%
“…Sponsored content merujuk kepada bentuk iklan yang serupa dengan konten asli media yang mempublikasikannya (Wojdynski, 2016a). Sponsored Hyperlink Listings menyajikan tautan di luar situs penerbit pada sebuah situs yang berfungsi untuk mengarahkan audiens ke konten dalam situs lain.…”
Section: Pendahuluanunclassified
See 1 more Smart Citation
“…Observe that any kernel is a (2, 1)-kernel and a quasikernel, introduced in [15], is a (2, 2)-kernel. The concept of (k, l)-kernel is a nice, wide generalization of the concept of kernel; (k, l)-kernels have been deeply studied by several authors, see for example [12,24,25,26].…”
Section: Introductionmentioning
confidence: 99%
“…There are not many results concerning the existence of k-kernels nor (k, l)-kernels in large families of digraphs. Many of the existing results come from the study of products of graphs and digraphs and how the k-kernels are preserved (like the work of Włoch and Włoch, in particular with Szumny in [20,21]) or the superdigraphs of certain families of digraphs ( [15]). We begin with some of the classical results in Kernel Theory that we will use as platform for the results we propose.…”
Section: Introductionmentioning
confidence: 99%