摘要
本文通过乘积图 G× k_m 的特征,刻划了带悬挂点约束支撑树变换图的结构,进而说明了这种变换图是边—Hamilton 图。作为这个结果的应用,本文证明了带悬挂点约束支撑树叶若干参数具有内插性质。
In this paper,the structure of the transformation graph of spanning trees with con-straint of end points is characterized by a product of graphs G×K_m Further more,the re-sult that the transformation graph of spanning trees with constraint of end points is edge Hamilton graph is obtained.As an immediate consequence of the result,we show that the spanning trees with constraint of end points have the property of interpolation for several oarameters.
出处
《河南科学》
1990年第3期1-8,共8页
Henan Science
基金
本文的工作部分地得到了国家自然科学基金和航空科学基金的资助。
关键词
变换图
支撑树
通讯网络
Transormation graph
Spanning trees
Edge-Hamilton graph