An implicit degree condition for hamiltonian graphs

详细信息	查看全文 | 推荐本文 |

• 作者：Hao Li^a ; ^b ; ^li@lri.fr ; Wantao Ning^a ; ^c ; ^{ningwt05@163.com} ; Junqing Cai^a ; ^{cajq09@lzu.edu.cn}
• 关键词：Implicit degree ; Independent set ; Hamiltonian cycle ; Degree sum
• 刊名：Discrete Mathematics
• 出版年：2012
• 期刊代码：47_0012365x
• 类别：cp
• 出版时间：28 July, 2012
• 卷：312
• 期：14
• 页码：2190-2196
• 文件大小：215 K

摘要

In 1980, Bondy generalized known Ore鈥檚 theorem by proving that a -connected graph of order is hamiltonian if a degree sum of any independent vertices is greater than . In this work, we generalize this result replacing the degree sum by the implicit degree sum. A concept of the implicit degree was introduced by Zhu et聽al. in 1989聽.