About quasi-kernels in a digraph

We generalize a result by Maghout who had shown that every tournament of radius 2 admits three distinct centers. Here we prove that every graph without kernel has at least three distinct quasi-kernels.