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. In this paper, C(v,m) is determined for any fixed odd positive intege...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. In this paper, C(v,m) is determined for any fixed odd positive integer m and positive integer v, m ≤ v ≤ m + 6.展开更多
基金Wang is funded by Science and Technology Project of Hebei Education Department(No.ZD2022168)Project of Cangzhou Normal University(No.XNJJLYB2021006)+3 种基金Ren is supported by NSFC(No.12001310)Liu is supported in part by NSFC(No.12171165)China Postdoctoral Science Foundation(No.2020M680494)Tianjin Natural Science Foundation(No.19JCYBJC30200)。
文摘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. In this paper, C(v,m) is determined for any fixed odd positive integer m and positive integer v, m ≤ v ≤ m + 6.
