Minimum Coverings of Complete Directed Graphs with Odd Size Circuits
Received:June 21, 1999  
Key Words: m-circuits   covering number   complete directed graph.  
Fund Project:Supported by NSFHB (197173 and 101092)
Author NameAffiliation
LIANG Zhi-he Dept. of Math.
Hebei Normal University
Shijiazhuang
China 
Hits: 2024
Download times: 821
Abstract:
      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.
Citation:
DOI:10.3770/j.issn:1000-341X.2002.03.013
View Full Text  View/Add Comment