Wiener指数，Hyper-Wiener指数，Harary指数与图的哈密顿性  

Wiener Index, Hyper-Wiener Index, Harary Index and Hamiltoniancity of Graph

作　　者：李星星 余桂东 任丽芳 LI Xingxing;YU Guidong;REN Lifang(School of Mathmatics and Computation Sciences,Anqing Normal University,Anqing 246133,China)

机构地区：[1]安庆师范大学数学与计算科学学院

出　　处：《安庆师范大学学报（自然科学版）》2019年第3期16-19,共4页Journal of Anqing Normal University(Natural Science Edition)

基　　金：安徽省高校自然科学基金(KJ2015ZD27,KJ2017A362)

摘　　要：如果一个图中任意两顶点都被一条哈密尔顿路相连,则称它是哈密尔顿-连通的。如果一个图中含有从任意一点出发的哈密顿路,则称这个图从任意一点出发都是可迹的。本文利用补图的Wiener指数,hyper-Wiener指数,Harary指数,分别给出了具有最小度条件的连通图是哈密顿-连通的以及从任一点出发都是可迹的充分条件。It is said to be Hamilton-connected if every two vertices of a graph are connected by Hamilton path. A graph is said to be traceable from every vertex if it contains a Hamilton path from every vertex. In this paper, let G be a connected graph with given minimum degree, in terms of the Wiener index, hyper-Wiener index, Harary index of the complement of G, the sufficient conditions for G to be Hamilton-connected and traceable from any point is given, respectively.

关 键 词：WIENER指数 hyper-Wiener指数 Harary指数 哈密顿-连通的 可迹的 

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