|
|||||
|
|
| 路可扩图的一个充分条件 | |
| 引用本文： | 尤海燕,赵强. 路可扩图的一个充分条件[J]. 纯粹数学与应用数学, 2010, 26(5): 721-724. DOI: 10.3969/j.issn.1008-5513.2010.05.004 |
| 作者姓名： | 尤海燕 赵强 |
| 作者单位： | 山东建筑大学理学院,山东,济南,250101;山东师范大学数学科学学院,山东,济南,250014 |
| 基金项目： | 国家自然科学基金，山东省自然科学基金 |
| 摘 要： | 通过讨论图中任意一对不相邻顶点的度和,对路可扩图的充分条件进行研究,得到了如下结果：设图G的阶是n,如果G中任意一对不相邻顶点的度和至少为3/2n-1,则图G是路可扩的.并且说明了这里两不相邻顶点的度和的下界3/2n-1是最好可能的. |
| 关 键 词： | 路可扩图 图的阶 顶点的度 |
A sufficient condition for path extendable graphs |
|
| YOU Hai-yan,ZHAO Qiang. A sufficient condition for path extendable graphs[J]. Pure and Applied Mathematics, 2010, 26(5): 721-724. DOI: 10.3969/j.issn.1008-5513.2010.05.004 | |
| Authors: | YOU Hai-yan ZHAO Qiang |
| Affiliation: | 1. School of Science, Shandong Jianzhu University, Ji＇nan 250101, China;2. School of Mathematical Sciences, Shandong Normal University, Ji＇nan 250014, China) |
| Abstract: | This paper studies the sufficient condition for path extendable graphs based on the degree sum of each pair of nonadjacent vertices.The following result is proved.Let G be a graph of order n,if the degree sum is at least 3/2n-1 for each pair of nonadjacent vertices in V(G),then graph G is path extendable.The bound 3/2n-1 is sharp. |
| Keywords: | path extendable graph order of graph degree of vertex |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |