| On κ—ordered Graphs Involved Degree Sum |
| |
| 作者姓名： | Zhi-quanHu FengTian |
| |
| 作者单位： | [1]DepartmentofMathematics,CentralChinaNormalUniversity,Wuhan430079,China [2]InstituteofSystemSciences,AcademyofMathematicsandSystemSciences,ChineseAcademyofSciences,Beijing100080,China |
| |
| 摘 要： | A graph G is κ-ordered Hamiltonian 2≤κ≤n,if for every ordered sequence S of κ distinct vertices of G,there exists a Hamiltonian cycle that encounters S in the given order,In this article,we prove that if G is a graph on n vertices with degree sum of nonadjacent vertices at least n 3κ-9/2,then G is κ-ordered Hamiltonian for κ=3,4,…,n/19].We also show that the degree sum bound can be reduced to n 2κ/2]-2 if κ(G）≥3κ-1/2 or δ（G）≥5κ-4.Several known results are generalized.
|
| 关 键 词： | 图 度 Hamilton图 阶 |
On <Emphasis Type="Italic">k</Emphasis>-ordered Graphs Involved Degree Sum |
| |
| Zhi-quanHu FengTian.On k-ordered Graphs Involved Degree Sum[J].Acta Mathematicae Applicatae Sinica,2003,19(1):97-106. |
| |
| Authors: | Email author" target="_blank">Zhi-quan?HuEmail author Feng?Tian |
| |
| Institution: | (1) Department of Mathematics, Central China Normal University, Wuhan 430079, China (E-mail: huzhiq2002@yahoo.com), CN;(2) Institute of System Sciences, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China (E-mail: ftian@staff.iss.ac.cn), CN |
| |
| Abstract: | |
| |
| Keywords: | k-ordered k-ordered Hamiltonian degree sum |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
