| 关于最小可行图的判别条件 |
| |
| 引用本文： | 李双臻. 关于最小可行图的判别条件[J]. 哈尔滨师范大学自然科学学报, 1997, 13(3): 37-39 |
| |
| 作者姓名： | 李双臻 |
| |
| 作者单位： | 哈尔滨师范大学 |
| |
| 摘 要： | 本文给出了一组判别最小可行图的充分必要条件，并给出了严格的证明。
|
| 关 键 词： | 最小可行图 树 充要条件 可行图 判别条件 |
ABOUT THE ENOUGH AND NECESSARY CONDITION OF A MINIMUM FEASIBLE GRAPH |
| |
| Li Shuangzhen. ABOUT THE ENOUGH AND NECESSARY CONDITION OF A MINIMUM FEASIBLE GRAPH[J]. Natural Science Journal of Harbin Normal University, 1997, 13(3): 37-39 |
| |
| Authors: | Li Shuangzhen |
| |
| Affiliation: | Harbin Normal University |
| |
| Abstract: | In ths paper,we give a sufficient and necessary condition for a minimum feasible graph with a sequence the proof has been given too. |
| |
| Keywords: | Minimum feasible graph Tree Sufficient and necessary condition |
| 本文献已被 CNKI 维普 等数据库收录！ |
