|
|||||
|
|
| 邻集并与图的Hamilton连通性 | |
| 引用本文： | 储茂权,丁立风.邻集并与图的Hamilton连通性[J].中北大学学报,1992(4). |
| 作者姓名： | 储茂权 丁立风 |
| 摘 要： | 设G是一个n阶三连通图,且最小度δ(G)≥t,本文证明了若对于G中任意距离为2的点u和v,均有|N(u)∪N(v)|≥n-t+2,则G是Hamilton连通图。 |
| 关 键 词： | 集 邻集并 连通图 Hamilton连通图 距离 |
NEIGHBORHOOD UNIONS AND HAMILTON-CONNECTEDNESS OF GRAPHS |
|
| Chu Maoquam Ding lifeng.NEIGHBORHOOD UNIONS AND HAMILTON-CONNECTEDNESS OF GRAPHS[J].Journal of North University of China,1992(4). | |
| Authors: | Chu Maoquam Ding lifeng |
| Affiliation: | Chu Maoquam Ding lifeng |
| Abstract: | |
| Keywords: | sets neighborhood unions connected graphs Hamilton-connected graph distance |
| 本文献已被 CNKI 等数据库收录！ | |