J4 ›› 2011, Vol. 24 ›› Issue (1): 68-71.

• 目录 • 上一篇    下一篇

2-连通[4,1]-图的Hamilton圈

 张伟, 王江鲁   

  1. 山东师范大学数学科学学院,山东 济南 250014
  • 出版日期:2011-02-20 发布日期:2011-02-20

Hamilton cycles of 2-connected [4,1]-graphs

 ZHANG Wei, WANG Jiang-Lu   

  1. School of Mathematics, Shandong Normal University, Jinan 250014, China
  • Online:2011-02-20 Published:2011-02-20

摘要:

       如果G的任意s个点的导出子图中至少含有t条边,则称图G为[s, t]-图。本文证明了以下结果:2-连通[4,1]-图是Hamilton图的充要条件是它不同构于三类特殊的图。

关键词: [s, t]-图, Hamilton圈, 连通

Abstract:

       A graph G is a [s,t]- graph if there are at least t edges in every included subgraph of s vertices. This paper proves that the sufficient and necessary condition of a 2-connected [4,1]- graph to be a Hamilton cycle is that it is not isomorphic to three kinds of specific graphs.

Key words: [s,t]- graph, Hamilton cycle, connectivity

中图分类号: 

  • O157.5