Bounds on the edge-Wiener index of cacti with n vertices and t cycles

Publication date: 3 September 2018

Abstract: The edge-Wiener index

W_{e} (G)

of a connected graph

G

is the sum of distances between all pairs of edges of

G

. A connected graph

G

is said to be a cactus if each of its blocks is either a cycle or an edge. Let

m a t h c a l G_{n, t}

denote the class of all cacti with

n

vertices and

t

cycles. In this paper, the upper bound and lower bound on the edge-Wiener index of graphs in

m a t h c a l G_{n, t}

are identified and the corresponding extremal graphs are characterized.

This page was built for publication: Bounds on the edge-Wiener index of cacti with $n$ vertices and $t$ cycles