给定度序列的三圈图的极值图

Extremal graphs on the tricyclic graphs with prescribed degree sequence

设G是1个简单连通图,Rf(G)表示图G的某个基于相邻顶点的度定义的分子拓扑指数.为得出1个给定度序列的三圈图最大或最小的Rf(G),利用反证法,获得了使三圈图最大化及最小化的Rf的极值图.

Let G be a simple connected graph, and Rf(G) denote a molecular topological index defined by the degrees of adjacent vertices of G. In order to obtain the maximum or minimum Rf(G) for a given degree sequence of tricyclic graphs, the extremal graphs on the tricyclic graphs are obtained by using proof by contradiction.