双星树的度距离研究

On the Degree Distance of Star-Like Trees

G=(V,E)表示顶点集为V,边集为E的所有的简单连通图的集合.本文研究了S(p,q)的度距离,得到D'(S(p,q))按照p(或q)的一个排序,并对它们的极值情况下的极图进行了刻画.

G = （ V, E ）is the set of simple connect graph with vertex set V, edge set E. The degree distance of S （p, q ） is investigated, and get an order with respect to p（or q ） of D＇（ S（p, q ） ） , the extremal graphs achieved the extremal values are characterized as well.