| 含邻域交的Hamilton及Hamilton连通图 |
| |
| 引用本文： | 肖新平. 含邻域交的Hamilton及Hamilton连通图[J]. 武汉理工大学学报(交通科学与工程版), 2000, 24(3) |
| |
| 作者姓名： | 肖新平 |
| |
| 作者单位： | 武汉交通科技大学基础教育学院,武汉,430063 |
| |
| 摘 要： | 对任意一对不相邻的顶点u和v,α(u,v)表示图G中含u,v的最大独立集的顶立数.通过讨论邻域交|N(u)∩N(v)|与α(u,v)的关系,本文得到了关于Hamilton及Hamilton连通图的新的充分条件,这些结果推广了现有的有关结果.
|
| 关 键 词： | Hamilton连通 邻域交 独立数 |
Hamiltonian and Hamiltonian Connected Graphs Involving Neighborhood Intersections |
| |
| Xiao Xinping. Hamiltonian and Hamiltonian Connected Graphs Involving Neighborhood Intersections[J]. journal of wuhan university of technology(transportation science&engineering), 2000, 24(3) |
| |
| Authors: | Xiao Xinping |
| |
| Abstract: | For any pair of nonadjacent vertices u and v,using α(u,v) to denote the maximum cardinality of an independent vertex set of G containing both u and v.By discussing the relationship between |N(u)∩N(v)| and α(u ,v), new sufficient conditions for hamiltonian and hamiltonian connected grap hs are obtained. |
| |
| Keywords: | Hamilton hamiltonian hamiltonian connected nei ghborhood intersections independent number |
| 本文献已被 万方数据 等数据库收录！ |
|
