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

Ordering Bicyclic Graph by Maximum Sum-Connectivity Indices

和连通度指标是指图G的边的权的总和,这里边uν的权等于(d_G(u)+d_G(ν))-1/2,d_G(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 （dG（u） ＋ with dG（u） being the degree of the vertex u in G. In the paper, the n - vertex bicyclic graphs with a pen-dent path, and with the maximum and the second maximum sum - connectivity index are given, and the n - vertex bicyclic graphs with from the third and the fourth maximum sum - connectivity indices are determined.