| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5776982 | Discrete Mathematics | 2017 | 4 Pages |
Abstract
In this paper we prove the following result: Let D be a digraph and Î âDP(D). If there is a partition P={Î i}iâI of Î such that: For each iâI, Î i is transitive; and CD(P) has no odd cycles of order greater than 1, then D has Î - kernel. Some interesting previous results are obtained as a direct consequence of this result.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros,