数学季刊 ›› 2013, Vol. 28 ›› Issue (3): 355-359.
摘要: The Wiener index W(G) of a graph G is defined as the sum of distances between all pairs of vertices of the graph. Let Gc is the set of the complements of bipartite graphs with order n. In this paper, we characterize the graphs with the maximum and second-maximum Wiener indices among all the graphs in Gc, respectively.
中图分类号: