T^(4)H-图中的哈密顿圈  

Hamiltonian Cycles in T^(4)H-Graphs

作　　者：徐倩[1] 常之魁 赵彦[1] XU Qian;CHANG Zhikui;ZHAO Yan(College of HuiHua,Hebei Normal University,Shijiazhuang 050091,China;College of Mathematics and Statistics,Hebei University of Economics and Business,Shijiazhuang 050061,China)

机构地区：[1]河北师范大学汇华学院,河北石家庄050091 [2]河北经贸大学数学与统计学院,河北石家庄050061

出　　处：《数学的实践与认识》2021年第18期261-266,共6页Mathematics in Practice and Theory

基　　金：河北师范大学汇华学院科研基金(20170402,20180406);河北经贸大学科研基金(2017KYQ02)。

摘　　要：[3.3.3.3.6]铺砌是由正三角形和正六边形生成的阿基米德双铺砌.讨论阿基米德双铺砌[3.3.3.3.6]中有限子图的哈密顿性,首先在铺砌图[3.3.3.3.6]中定义了非平凡的,2-连通的,线性凸的有限子图T^(4)H-图,并利用归纳法证明了任何T^(4)H-图均为哈密顿图.[3.3.3.3.6]is Archimedean tiling of the plane formed by regular triangles and hexagons.In this paper,we discuss the hamiltonian property of finite subgraphs of Archimedean tiling [3.3.3.3.6].First,we define T^(4) H-graph as the nontrivial,two connected,linear convex subgraph of Archimedean tiling [3.3.3.3.6],and use induction to prove all T^(4) H-graph are hamiltonian graphs.

关 键 词：阿基米德铺砌 T^(4)H-图 哈密顿图 

分 类 号：O157.5[理学—数学]