Abstract
In this paper we present some results on the existence of k-kernels and (k, l)-kernels in digraphs which generalize the following Theorem of P. Duchet [2]: “If every directed cycle of odd length in a digraph D has at least two symmetrical arcs, then D has a kernel.”
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.