The Wiener index of a graph G is defined as W(G) = E_u,v∈(G)d_G(u,v), where d_G(u,v) is the distance between u and v in G and the sum goes over all the pairs of vertices. In this paper, we investigate the Wiener index of unicyclic graphs with given girth and characterize the extremal graphs with the minimal and maximal Wiener index.
展开▼
