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 G*c, is the set of the complements of bipartite graphs with order n. In this paper, we character...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 G*c, 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 G*c, respectively.展开更多
文摘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 G*c, 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 G*c, respectively.