科研之友
微信
新浪微博
Facebook
分享链接
摘要
The degree distance DD(G) of a connected graphs 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) = Sigma(SCV(G)) vertical bar(K) over bar vertical bar = k [Sigma(v is an element of S)deg(G)(v)] 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. Expressions for SDDk for some special graphs are obtained, as well as sharp upper and lower bounds of SDDk of a connected graph. Some properties of SDDk of trees are established.
