Let G be a connected graph and S a set of vertices of G. The Steiner distance of S is the smallest number of edges in a connected subgraph of G that contains S and is denoted by d(G) (S) or d(S). The Steiner n-eccentricity e(n) (v) and Steiner n-distance
