邻接树图的Hamilton性质  

The Hamilton-Properties of Adjacency Tree Graph

作　　者：吴惠仙[1] 罗和治[2] 

机构地区：[1]杭州电子工业学院理学分院,浙江杭州310037 [2]浙江工业大学理学院,浙江杭州310032

出　　处：《杭州电子工业学院学报》2003年第3期12-15,共4页Journal of Hangzhou Institute of Electronic Engineering

基　　金：杭州电子工业学院学科建设资助项目(026106)

摘　　要：文献1给出了简单连通图G的邻接树图T(G)是完全图的充分必要条件是:G的圈基数ρ(G)=1且此回路的长度为3。主要讨论ρ(G)≤2时的邻接树图T(G)的Hamilton性质:若G是ρ(G)≤2的简单连通图,则G的邻接树图T(G)是Hamilton图。In Ref.1, the adjacency tree graph T(G) of simple connected graph G is a complete graph if and only if base number of cycle ρ(G)=1 and the length of the cycle is three. In this paper, we discuss the Hamilton properties of the adjacency tree graph T(G):if G is a simple connected graph with ρ(G)≤2, then its adjacency tree graph T(G) is a Hamilton graph.

关 键 词：邻接树图 圈基数 HAMILTON性质 生成树 

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