journal6 ›› 2008, Vol. 29 ›› Issue (1): 10-12.

• 数学 • 上一篇    下一篇

k-因子的哈密顿性质

  

  1. (枣庄学院数学系,山东 枣庄 277160)
  • 出版日期:2008-01-25 发布日期:2012-05-26

Hamiltonian in k-Factor in Graph

  1. (Dept. of Math.,Zaozhuang College,Zaozhuang 277160,Shandong China)
  • Online:2008-01-25 Published:2012-05-26
  • About author:WANG Bing(1971-),female,was born in Wuhu City,Anhui Province,associate professor of Zaozhuang College,master;research area is theory of graph.
  • Supported by:

    National Natural Science Foundation of China (10471078)

摘要:借助Bauer定理给出了一个猜想的简短证明:如果图G含有k-因子且是2-连通的,并满足σ2(G)≥n-k,那么图G是哈密顿的.

关键词: 连通图, k-因子, 哈密顿

Abstract: Through Bauer Theorem,the author gives a new short proof of a conjecture:let G be a 2-connected graph on n vertices where every pair of nonadjacent vertices has degree sum at least n-k and assume furthermore that G has a k-factor,then G is Hamiltonian.

Key words: connected graph, k-factor, Hamiltonian

公众号 电子书橱 超星期刊 手机浏览 在线QQ