Steiner Degree Distance of Two Graph Products

The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈Sdeg⁡G(v)]dG(S),SDD_k (G) = \sum\limits_{\mathop {S \subseteq V(G)}\limits_{\left| S \right| = k} } {\left[ {\sum\limits_{v \in S} {{\it deg} _G (v)} } \right]d_G (S),} where d_G(S) is the Steiner k-distance of S and deg_G(v) is the degree of the vertex v in G. In this paper, we investigate the Steiner degree distance of complete and Cartesian product graphs.