赋权完全图K_n中最短H圈与最短H通路  

Weighted Complete Graph Kn of H Shortest Ring and H Shortest Path

作　　者：张祥波 

机构地区：[1]临盘中学,山东临邑251500

出　　处：《四川职业技术学院学报》2012年第4期150-152,共3页Journal of Sichuan Vocational and Technical College

摘　　要：本文证明了赋权完全图Kn中关于最短H圈与最短H通路的两个定理,由此得到了它们的一个上确界.通过探讨最短H圈的有关性质,得到了关于最短H通路的对偶性结论,文末研究了它们之间的关系,使之更接近最优解.This paper proves two theorems of weighted complete graph Kn on H shortest ring and H shortest path,thus a supremum is obtained.The discussion of the shortest H circle properties reaches a duality conclusion on H shortest path.By studing the relationship between them,the author finds out an optimal solution of the theorems.

关 键 词：赋权完全图 最短H圈 最短H通路 

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