On extremal cacti with respect to the edge revised Szeged index

Abstract: Let

G

be a connected graph. The edge revised Szeged index of

G

is defined as

S z_{e}^{a s t} (G) = s u m l i m i t s_{e = u v i n E (G)} (m_{u} (e | G) + f r a c m_{0} (e | G) 2) (m_{v} (e | G) + f r a c m_{0} (e | G) 2)

, where

m_{u} (e | G)

(resp.,

m_{v} (e | G)

) is the number of edges whose distance to vertex

u

(resp.,

v

) is smaller than the distance to vertex

v

(resp.,

u

), and

m_{0} (e | G)

is the number of edges equidistant from both ends of

e

. In this paper, we give the minimal and the second minimal edge revised Szeged index of cacti with order

n

and

k

cycles, and all the graphs that achieve the minimal and second minimal edge revised Szeged index are identified.

This page was built for publication: On extremal cacti with respect to the edge revised Szeged index