| 关于图的连通分支 |
| |
| 引用本文： | 呼勇.关于图的连通分支[J].延安大学学报(自然科学版),2008,27(2):17-19. |
| |
| 作者姓名： | 呼勇 |
| |
| 作者单位： | 延安职业技术学院,陕西,延安,716000 |
| |
| 摘 要： | 通过对图的连通分支的大小以及结构进行探讨，得到了若干新的结果。
|
| 关 键 词： | 图论 连通分支 最大连通分支 最小最大分支 |
Study of Component of Graphs |
| |
| HU Yong.Study of Component of Graphs[J].Journal of Yan'an University(Natural Science Edition),2008,27(2):17-19. |
| |
| Authors: | HU Yong |
| |
| Institution: | HU Yong (Yanan Vocational and Technical College, Yanan, Shaanxi 716000) |
| |
| Abstract: | In this paper, the size and the structure of component of graphs are studied, and some results are obtained. The obtained results provide a theoretical foundation of new applications. |
| |
| Keywords: | graph theory component maximum component minimum maximum component |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
