连通图和不连通图的维纳指数W(G)  

The Wiener Indices of Connected Graph and Disconnected Graph

作　　者：张冰[1] 

机构地区：[1]广东技术师范学院计算机科学学院,广东广州510665

出　　处：《广东技术师范学院学报》2008年第6期24-25,共2页Journal of Guangdong Polytechnic Normal University

摘　　要：一个连通图的维纳指数W(G)等于图中所有无序点对的距离之和。本文研究了连通图和不连通图的维纳指数W(G),得到了上界图;以及研究了W(G)+W(G)的上界和下界。The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. In this paper, we discuss the Wiener index of connected and disconnected graph which maximaize the Wiener index among all graphs of connected graphs and disconnected graph.

关 键 词：维纳指数 连通图 不连通图 

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