| 有向图中最长路或圈 |
| |
| 引用本文： | 宋增民.有向图中最长路或圈[J].东南大学学报(自然科学版),1987(4). |
| |
| 作者姓名： | 宋增民 |
| |
| 作者单位： | 南京工学院数学力学系 |
| |
| 摘 要： | 本文讨论了有向图中最长路或圈和二部竞赛图的Hamilton圈,得到关于点的次的几个充分条件,在某种意义上说,这些条件是最好的可能。
|
| 关 键 词： | 有向图 竞赛图 路 圈 |
The Longest Path or Cycle in Digraph |
| |
| Song Zengmin.The Longest Path or Cycle in Digraph[J].Journal of Southeast University(Natural Science Edition),1987(4). |
| |
| Authors: | Song Zengmin |
| |
| Institution: | Department of Mathematics and Mechanics |
| |
| Abstract: | In this paper, we discuss the longest path or cycle in digraph and Hamilton cycles in bipartite tournament, and obtain several sufficient conditions on degree of vertex. In some sence, these conditions are best possible. |
| |
| Keywords: | digraph tournament path cycle |
| 本文献已被 CNKI 等数据库收录！ |
