单圈图关于和连通度指标的最大值的排序

Ordering Unicyclic Graph by Maximum Sum-connectivity Indices

和连通指标是指图G的边的权的总和,这里边uv的权等于(dG(u)+dG(ν))-12,dG(u)表示点u的度。文章得到了恰好含有三条悬挂路的单圈图的和连通度指标的可达上界,也确定了和连通度指标的第二到第八最大值的单圈图。

The sum - connectivity index of graph G is defined as the sum of the weights of the edges of G, where the weight of an edge uv of G is with being the degree of the vertex u in G. In the paper, the sharp upper bound of the sum- connectivity index of n - vertex uniey- elie graphs with three pendent paths is given, and the n - vertex unicyelic graphs with from the second to the eighth maximum sum- con- nectivity indices are determined.