A sufficient condition for cyclability in directed graphs

Given a strongly connected digraph DD of order nn and a subset SS of V(D)V(D), we prove that if any two nonadjacent vertices of SS have degree sum at least 2n-12n-1, there is a directed cycle in DD that contains all the vertices of SS. This result generalizes the theorem of Meyniel on hamiltonicity.