Steiner Wiener Index of Certain Windmill Graphs.

For a connected graph G of order p and a non-empty subset S of the vertex set of G, the n-Steiner distance of S is defined to be the smallest size among all connected sub-graphs whose vertex sets contain. In this paper, we obtain the Hosoya polynomials of Steiner n-distance of some windmill graphs. Moreover, the Steiner Wiener indices of certain windmill graphs are also obtained. [ABSTRACT FROM AUTHOR]