A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
k-Kernels and some operations in digraphs

2009
*
Discussiones Mathematicae Graph Theory
*

Let D be a digraph. V (D) denotes the set of vertices of D; a set N ⊆ V (D) is said to be a k-kernel of D if it satisfies the following two conditions: for every pair of different vertices u, v ∈ N it holds that every directed path between them has length at least k and for every vertex x ∈ V (D) − N there is a vertex y ∈ N such that there is an xy-directed path of length at most k − 1. In this paper, we consider some operations on digraphs and prove the existence of k-kernels in digraphs

doi:10.7151/dmgt.1431
fatcat:qji2zscphzetflh2ufmaweoz3y