山东科学2011，Vol.24Issue(6)：8-11,4.
2-连通P3-支配图的Hamilton圈
Hamilton cycle of 2-connected P3-dominated graphs
陈维娜 1王江鲁1
作者信息
- 1. 山东师范大学数学科学学院,山东济南250014
- 折叠
摘要
Abstract
A graph G is a P3-dominated graph if J（x,y） UJ＇（x,y）≠φ for any pair of vertices x and y of d（x,y） =2. This paper proves that for any pair of non-adjacent vertices x and y in G,which is a 2.-connected P3-dominated graph of order n no less than 3, if 2｜N（x）UN（y）｜＋d（x）＋d（y）≥2n-5, then G has a Hamilton cycle or G∈{K2,3,K1,1,3}.关键词
半无爪图/P3-支配图/Hamilton圈Key words
quasi-claw-free graphs/P3-dominated graphs/Hamilton cycle分类
数理科学引用本文复制引用
陈维娜,王江鲁..2-连通P3-支配图的Hamilton圈[J].山东科学,2011,24(6):8-11,4.
