Add to ORKGA kernel $J$ of a digraph $D$ is an independent set of vertices of $D$ such that for every vertex $w,in,V(D),setminus,J$ there exists an arc from $w$ to a vertex in $J.$ In this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. This characterization is a partial solution to the following problem: Characterize circulant digraphs which have kernels; it appeared in the book {it Digraphs - theory, algorithms and applications}, Second Edition, Springer-Verlag, 2009, by J. Bang-Jensen and G. Gutin
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D...
In this paper, we prove the following sufficient condition for the existence of k-kernels in digraph...
AbstractIn this paper we present some results on the existence of k-kernels and (k, l)-kernels in di...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
AbstractLet D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respective...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w∈V(D)−...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every x∈V(D)−...
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D)−N the...
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (...
Let D be a digraph with V(D) and A(D) the sets of vertices and arcs of D, respectively. A kernel of ...
Let D be a digraph, V (D) and A (D) will denote the sets of vertices and arcs of D, respectively. A ...
Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k...
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D...
In this paper, we prove the following sufficient condition for the existence of k-kernels in digraph...
AbstractIn this paper we present some results on the existence of k-kernels and (k, l)-kernels in di...
AbstractLet D be a finite digraph, V(D) and A(D) will denote the sets of vertices and arcs of D resp...
AbstractLet D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respective...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every w∈V(D)−...
AbstractA kernel N of a digraph D is an independent set of vertices of D such that for every x∈V(D)−...
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D)−N the...
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (...
Let D be a digraph with V(D) and A(D) the sets of vertices and arcs of D, respectively. A kernel of ...
Let D be a digraph, V (D) and A (D) will denote the sets of vertices and arcs of D, respectively. A ...
Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k...
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...
A set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has...