文献类型：期刊文献

中文题名：基于强乘积运算下图的广义和连通度指标上下界

英文题名：The sharp bounds on general sum-connectivity index of graphs for operations based on strong product

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

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

年份：2024

卷号：28

期号：1

起止页码：141

中文期刊名：运筹学学报（中英文）

外文期刊名：Operations Research Transactions

收录：CSTPCD;;北大核心:【北大核心2023】；CSCD:【CSCD2023_2024】；

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

语种：中文

中文关键词：广义和连通度指标;强乘积;四种运算;F-和

外文关键词：general sum-connectivity index;strong product;four new operations;F-sum

摘要：对于图G,令E(G)表示G的边集,令V(G)表示G的点集,d_(G)(v)表示v的度。对于边e=uv,定义广义和连通度指标χ_(α)(e)=(d_(G)(u)+d_(G)(v))^(α),其中α为任一实数。本文先介绍了图的S,R,Q,T四种运算,然后给出了四种运算下的强乘积,并利用最大度最小度确定了其四种图的广义和连通度指标的上下界。
For a graph G,the edge set of graph G denoted by E(G),the vertex set of graph G denoted by V(G),let d_(G)(u)denote the degree of.For an edge e=uv,the general sum-connectivity index χ_(α)(e)=(d_(G)(u)+d_(G)(v))^(α),in whichαis any real number.In current paper,we introduce firstly the four operations(S,R,Q,T)of the graph,then give the strong product under the four operations,and determine the upper and lower bounds of the general sum-connectivity index of the four graphs by using the maximum and minimum degrees.