Steniner distancepol ynomial of graph

Abstract EN

The steiner n-distance polynomial of a connected graph G , Wn (G;'), is defined as^ Mn (G, X)X* where k>n-1 Mn (G, X) is the number of n-sets of vertices of G that are of n-distance X.

Such polynomials W (G\') are obtained for some special graphs and for compound graph G\ • G^ and G|: G^ .

Moreover, we give an upper