G. Gutin, K. M. Koh, E. G. Tay and A. Yeo, “On the Number of Quasi-Kernels in Digraphs,” Journal of Graph Theory, Vol. 46, No. 1, 2004, pp. 48-56. doi:10.1002/jgt.10169
has been cited by the following article:
TITLE: Quasi-Kernels for Oriented Paths and Cycles
AUTHORS: Stephen Bowser, Charles Cable
KEYWORDS: Digraph; Quasi-Kernel; Path; Cycle
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.2, April 27, 2012
ABSTRACT: If D is a digraph, then K∈V(D) is a quasi-kernel of D if D［K］is discrete and for each y∈V(D)－K there is x∈K such that the directed distance from y to x is less than three. We give formulae for the number of quasi-kernels and for the number of minimal quasi-kernels of oriented paths and cycles.