| 图的度和与扩路 |
| |
| 引用本文： | 刘春房,王江鲁.图的度和与扩路[J].数学进展,2012(3):356-360. |
| |
| 作者姓名： | 刘春房 王江鲁 |
| |
| 作者单位： | 滨州学院数学与信息科学系;山东师范大学数学科学学院 |
| |
| 基金项目： | 山东省高等学校科技计划项目(No.J101.A11.);山东科技大学“春蕾计划”项目(No.2010Azz053) |
| |
| 摘 要： | 本文讨论了两顶点的度和与路可扩之间的关系,得到了如下结果:设G是n阶图,如果G中任意一对不相邻的顶点u,v满足d(u)+d(v)≥n+n/k(2≤k≤n-2),则G中任意一个满足k+1≤|P|
|
| 关 键 词： | 顶点的度 路可扩 Hamilton路 |
Extending Paths and Degree Sums in Graphs |
| |
| LIU Chunfang,WANG Jianglu.Extending Paths and Degree Sums in Graphs[J].Advances in Mathematics,2012(3):356-360. |
| |
| Authors: | LIU Chunfang WANG Jianglu |
| |
| Institution: | 1.Department of Mathematics and Computer Science,Binzhou University,Binzhou,Shandong, 256603,P.R.China;2.School of Mathematical Sciences,Shandong Normal University,Jinan,Shandong, 250014,P.R.China) |
| |
| Abstract: | In this paper,we study the relations between degree sums and extending paths in graphs.The following result is proved.Let G be a graph of order n.If d(u) + d(v)≥n +(?)(n≤k≤n - 2) for each pair of nonadjacent vertices u,v in V(G),then every path P of G with k + 1≤\P\ < n is extendable.The lower bound of |P| is sharp. |
| |
| Keywords: | degree of vertex extending path Hamilton path |
| 本文献已被 CNKI 等数据库收录！ |
|
