文献类型：期刊文献

中文题名：基于字典序乘积下广义和连通度指标的上下界

英文题名：Sharp Bounds on General Sum-Connectivity Index Based on Lexicographic Product

作者：李志豪[1];朱焱[1]

机构：[1]华东理工大学数学学院,上海200237

年份：2022

卷号：48

期号：3

起止页码：405

中文期刊名：华东理工大学学报（自然科学版）

外文期刊名：Journal of East China University of Science and Technology

收录：Scopus;北大核心:【北大核心2020】；CSCD:【CSCD_E2021_2022】；

基金：国家自然科学基金(11671135)。

语种：中文

中文关键词：广义和连通度指标;字典序乘积;图的4种运算;F-和

外文关键词：general sum-connectivity index;lexicographic product;four operation on graphs;F-sum

摘要：对于图G,令E(G),d_(G)(v)分别表示G的边集和顶点v的度。对于边e=uv,定义广义和连通度指标χ_(α)(e)=(d_(G)(u)+d_(G)(v))^(α),其中α为任意实数。在对两个简单的连通图G和H做乘积之前,先对其中一个图H进行S,R,Q,T4种运算,运算后的图记为F(H)(其中F∈{S,R,Q,T}),再对图G和F(H)做字典序乘积,给出了基于字典序乘积下图的广义和连通度的指标上下界,并且这些界都是最好的。
Give a graph G,let E(G)and d_(G)(v)respectively.For an edge e=uv,the general sum-connectivity index is χ_(α)(e)=(d_(G)(u)+d_(G)(v))^(α),in which α is any real number.Before taking the product of two simple connected graphs G and H,we first perform four operations of S,R,Q,Ton the graph H,denoted as F(H),in which F∈{S,R,Q,T},then take the lexicographical product of graphs G and F(H)lexicographic product are given,and these bounds are sharp.