On the Revised Edge-Szeged Index of Graphs
نویسندگان
1 School of Mathematics and Statistics, Hunan Normal University, Changsha City, Hunan Province, China
2 School of Mathematics and Statistics, Hunan Normal University, Changsha City, Hunan Province, China
3 School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P.R. China
doi
10.22052/ijmc.2019.200349.1460چکیده
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of edges of G lying closer to vertex v than to vertex u, and the number of edges equidistant to u and v. In this paper, we give an effective method for computing the revised edge-Szeged index of unicyclic graphs and using this result we identify the minimum revised edge-Szeged index of conjugated unicyclic graphs (i.e., unicyclic graphs with a perfect matching). We also give a method of calculating revised edge-Szeged index of the joint graph.
