|
|||||
|
|
| 完全有向图的奇长圈覆盖 | |
| 引用本文： | 梁志和. 完全有向图的奇长圈覆盖[J]. 数学研究及应用, 2002, 22(3): 396-400 |
| 作者姓名： | 梁志和 |
| 作者单位： | 河北师范大学数学与信息科学院,河北,石家庄,050016 |
| 基金项目： | Supported by NSFHB(197173and 101092) |
| 摘 要： | 设DKv表示完全有向对称图,C（v,m）表示覆盖DKv的m长有向圈的最小圈数（称为覆盖数）.对任意正整数m和v,当m≤v≤m+6时,覆盖数C（v,m） 被确定. |
| 关 键 词： | 完全有向圈 奇长圈覆盖 对称图 |
| 收稿时间： | 1999-06-21 |
Minimum Coverings of Complete Directed Graphs with Odd Size Circuits |
|
| LIANG Zhi-he. Minimum Coverings of Complete Directed Graphs with Odd Size Circuits[J]. Journal of Mathematical Research with Applications, 2002, 22(3): 396-400 | |
| Authors: | LIANG Zhi-he |
| Affiliation: | Dept. of Math.; Hebei Normal University; Shijiazhuang; China |
| Abstract: | Let DKv denote the symmetric complete directed graph with v vertices, thecovering number C(v, m) is a minimum number of covering DKv by m-circuits. In thispaper, C(v,m) is determined for any fixed odd positive integer m and positive integer v,m ≤ v ≤ m+6. |
| Keywords: | m-circuits covering number complete directed graph. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 | |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 | |