几类图运算的边Mostar指标  

Edge Mostar Index for Several Classes of Graph Operations

作　　者：千嘉乐 刘蒙蒙 QIAN Jia-le;LIU Meng-meng(School of Mathematics and Physics,Lanzhou Jiaotong University,Lanzhou 730070,China)

机构地区：[1]兰州交通大学数理学院,甘肃兰州730070

出　　处：《数学的实践与认识》2024年第11期183-194,共12页Mathematics in Practice and Theory

摘　　要：对于一个连通图G,其边Mostar指标定义为:Mo_(e)(G)=Σ_(e=uv∈E(G))|m_(u)^(G)(e)-m_(v)^(G)(e)|,其中m_(u)^(G)(e)表示在图G中距离顶点u比顶点v近的边的个数,m_(v)^(G)(e)表示在图G中距离顶点v比顶点u近的边的个数.本文确定了几类图运算的边Mostar指标的表达式.For a connected graph G,the edge Mostar index is defined as:Mo_(e)(G)=Σ_(e=uv∈E(G))|m_(u)^(G)(e)-m_(v)^(G)(e)|,where m_(u)^(G)(e)and m_(v)^(G)(e)are,resprespectively,the number of edges e=uvEE(G)of G lying closer to vertex u than to vertex u and the number of edges of G lying closer to vertex u than to vertex u.In this paper,the expressions of edge Mostar indexes for several classes of graph operations are determined.

关 键 词：边Mostar指标 倍图 联图 边冠图 

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