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

Extremal graphs on the tricyclic graphs with prescribed degree sequence

作　　者：杨杨 邵燕灵[1] YANG Yang;SHAO Yan-ling(School of Sciences,North University of China,Taiyuan 030051,China)

机构地区：[1]中北大学理学院,山西太原030051

出　　处：《云南民族大学学报（自然科学版）》2020年第4期332-337,共6页Journal of Yunnan Minzu University:Natural Sciences Edition

基　　金：山西省自然科学基金(201601D202003).

摘　　要：设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.

关 键 词：三圈图 度序列 分子拓扑指数 

分 类 号：O157.5[理学—数学]