| 梁志和.完全有向图的奇长圈覆盖(英文)[J].数学研究及应用,2002,22(3):396~400 |
| 完全有向图的奇长圈覆盖(英文) |
| Minimum Coverings of Complete Directed Graphs with Odd Size Circuits |
| 投稿时间：1999-06-21 |
| DOI：10.3770/j.issn:1000-341X.2002.03.013 |
| 中文关键词: |
| 英文关键词:m-circuits covering number complete directed graph. |
| 基金项目: |
|
| 摘要点击次数: 2032 |
| 全文下载次数: 825 |
| 中文摘要: |
| 设DKv表示完全有向对称图,C（v,m）表示覆盖DKv的m长有向圈的最小圈数（称为覆盖数）.对任意正整数m和v,当m≤v≤m+6时,覆盖数C（v,m） 被确定. |
| 英文摘要: |
| 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. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|
