Extending Digraphs to Digraphs with (without) k-Kernel
Hortensia Galeana‐Sánchez, Cient ́ ifica, Laura Pastrana Ram ́ õrez · 2008
For any digraph D we construct a digraph s(S) such that D has a k-kernel iff s(S) has a k-kernel. The method employed allows to prove that, any digraph is an induced subdigraph of an infinite set of digraphs with (resp. without) k-kernel; and it can be used as a powerful tool in the construction of a large class of digraphs with (resp. without) k-kernel. Previous results are generalyzed.