Let DKv denote the symmetric complete directed graph with v vertices , the covering number C ( v , m ) is a minimum number of covering DKv by m-circuits .
设DKv表示完全有向对称图，C（v，m）表示覆盖DKv的m长有向圈的最小圈数（称为覆盖数）。
DKV