检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王娅静 高玉斌[2] WANG Yajing;GAO Yubin(School of Data Science And Technology,North University of China,Taiyuan 030051,China;School of Science,North University of China,Taiyuan 030051,China)
机构地区:[1]中北大学大数据学院,太原030051 [2]中北大学理学院,太原030051
出 处:《运筹学学报》2020年第4期135-144,共10页Operations Research Transactions
基 金:山西省自然科学基金(No.201901D211227)。
摘 要:Randic指数是一类重要的分子拓扑指数,在数学及化学研究中有重要作用。树图、单圈图以及双圈图的Randic指数的上下界及其极图已有相关的结论。仙人掌图Randic指数的下界及极图已被刻画,而极大图的研究较为复杂。通过对仙人掌图中边的顶点度的分析,定义了对称边和非对称边,并且刻画了图的一些变换。在此基础上,根据仙人掌图中顶点的最大度分情况讨论,得到了给定圈数r的n阶仙人掌图中具有前五大Randic指数的极图中的非对称边结构。The Randic index was one of the most important molecular topological indices,and became a popular topic of research in mathematics and mathematical chemistry.The sharp upper and lower bounds of Randic index of trees,unicyclic graphs and bicyclic graphs have been obtained.Furthermore,the minimal graphs of trees,unicyclic graphs and bicyclic graphs on Randic index have been characterized.In addition,the lower bounds of cacti on Randic index and corresponding extremal graphs have been described.In this paper,we analyzed the degrees of vertices of the edges in cacti,defined the symmetric edges and the asymmetric edges,and characterized some transformations.Based on these definitions,we discussed in terms of maximum degree of vertices.In the end,the extremal graphs have been characterized by the asymmetric edges in cacti of n-vertex given the number of circles with the first,the second,the third,the fourth and the fifth maximum Randic index.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.19