Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9514568 | Electronic Notes in Discrete Mathematics | 2005 | 4 Pages |
Abstract
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 subdigraph of D has a kernel, D is said to be a kernel perfect digraph. Minimal non-kernel perfect digraph are called critical kernel imperfect digraph. If F is a set of arcs of D, a semikernel modulo F, S of D is an independent set of vertices of D such that for every zâV(D)âS for which there exists an Szâarc of DâF, there also exists an zSâarc in D. In this work new sufficient conditions for a digraph to be a critical kernel imperfect digraph, in terms of semikernel modulo F, are presented.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mucuy-kak Guevara, Hortensia Galeana-Sánchez,