On minimum revised edge Szeged index of bicyclic graphs
On minimum revised edge Szeged index of bicyclic graphs
复制标题
DOI：
10.1080/09728600.2022.2120440
复制
发表时间：
2022-09
期刊：
影响因子：
--
通讯作者：
Mengmeng Liu;Shengjin Ji
中科院分区：
文献类型：
--
作者：
Mengmeng Liu;Shengjin Ji
The revised edge Szeged indexof a graphGis defined as Sze*(G)=∑e=uv∈E(G)(mu(e)+m0(e)2)(mv(e)+m0(e)2), whereandare, respectively, the number of edges ofGlying closer to vertexuthan to vertexvand the number of edges ofGlying closer to vertexvthan to vertexu, andis the number of edges equidistant touandv. In the paper, we show the sharp lower bound of revised edge Szeged index regarding bicyclic graphs. Moreover, all extremal graphs are characterized.
