Edge Szeged Index of Unicyclic Graphs
Edge Szeged Index of Unicyclic Graphs
复制标题
DOI：
--
复制
发表时间：
2010
影响因子：
6.7
通讯作者：
Xiaochun Cai;Bo Zhou
中科院分区：
文献类型：
--
作者：
Xiaochun Cai;Bo Zhou
连通图G的边Szeged指标定义为图G的所有边e=UV上乘积Mu(e|G)Mv(e|G)的和，其中Mu(e|G)是到顶点u的距离小于到顶点v的距离的边数，MV(e|G)i S是到顶点v的距离小于到顶点u的距离的边数.本文确定了具有最大、第二大、最小和第二小边Szeged指标的n点单圈图.
The edge Szeged index of a connected graph G is defined as the sum of products mu(e|G)mv(e|G) over all edges e = uv of G, where mu(e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and mv(e|G )i s the number of edges whose distance to vertex v is smaller than the distance to vertex u. In this paper, we determine the n-vertex unicyclic graphs with the largest, the second largest, the smallest and the second smallest edge Szeged indices.