Jan 1, 1998 · A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V(D)⧹N there exists an arc from w to N. A digraph D ...
If every complete induced subdigraph of D is kernel-perfect, then D is a kernel-perfect digraph. Since every bipartite digraph is strongly perfect, we have the ...
Recommendations · k -kernels in k -transitive and k -quasi-transitive digraphs · Disjoint quasi-kernels in digraphs · On semicomplete multipartite digraphs whose ...
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V ( D )⧹ N there exists an arc from w to N . A digraph D is ...
Oct 15, 2018 · Richardson's theorem states that every digraph without a directed odd cycle has a kernel, and the proof gives rise to an algorithm to find ...
In the first part of this paper we give necessary and sufficient conditions for some special classes of digraphs to have a (k,l)-kernel.
Abstract. A kernel J of a digraph D is an independent set of vertices of D such that for every vertex w ∈ V (D)\J there exists an arc from w to a vertex.
People also ask
What are the different types of digraphs?
What is the Cartesian product of digraphs?
For plane digraphs we introduce a new parameter which we call the kernel number. For a plane digraph the kernel number is the minimum number.
Abstract. A kernel of a directed graph is a subset of vertices that is both independent and absorbing (every vertex not in the kernel has an out-neighbour ...
A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D) − N there exists an arc from w to N. If every induced ...