The Steiner k-Wiener index of graphs with given minimum degree

Abstract

Let G be a connected graph. The Steiner distance d(S) of a set S of vertices is the minimum size of a connected subgraph of G containing all vertices of S. For k ∈ N, the Steiner k-Wiener index SW k (G) is defined as