Bounding the Mostar index

Abstract: Dov{s}li'{c} et al. defined the Mostar index of a graph

G

as

M o (G) = s u m l i m i t s_{u v i n E (G)} | n_{G} (u, v) - n_{G} (v, u) |

, where, for an edge

u v

of

G

, the term

n_{G} (u, v)

denotes the number of vertices of

G

that have a smaller distance in

G

to

u

than to

v

. They conjectured that

M o (G) l e q 0. o v e r l i n e 148 n^{3}

for every graph

G

of order

n

. As a natural upper bound on the Mostar index, Geneson and Tsai implicitly consider the parameter

. For a graph

G

of order

n

, they show that

M o^{s} t a r (G) l e q f r a c 524 (1 + o (1)) n^{3}

. We improve this bound to

M o^{s} t a r (G) l e q l e f t (f r a c 2 s q r t 3 - 1 i g h t) n^{3}

, which is best possible up to terms of lower order. Furthermore, we show that

M o^{s} t a r (G) l e q l e f t (2 l e f t (f r a c D e l t a n i g h t)^{2} + l e f t (f r a c D e l t a n i g h t) - 2 l e f t (f r a c D e l t a n i g h t) s q r t l e f t (f r a c D e l t a n i g h t)^{2} + l e f t (f r a c D e l t a n i g h t) i g h t) n^{3}

provided that

G

has maximum degree

D e l t a

.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Bounding the Mostar index