Rights accessRestricted access - publisher's policy
Let D = (V,A) be a digraph with minimum in-degree at least 1 and girth at least l+1,
where l ≥ 1. In this work, the following result is proved: a digraph D has a (k,l)-kernel if and only if its partial line digraph LD does, where 1 ≤ l < k. As a consequence, the h-iterated line digraph $L^h$(D) is shown to have a kernel if and only if D has a kernel.
CitationBalbuena, C.; Guevara, M. Kernels and partial line digraphs. "Applied mathematics letters", Octubre 2010, vol. 23, núm. 10, p. 1218-1220.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com