Maximizing the Mostar index for bipartite graphs and split graphs

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

G

as

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

. Contributing to conjectures posed by Dov{s}li'{c} et al., we show that the Mostar index of bipartite graphs of order

n

is at most

f r a c s q r t 3 18 n^{3}

, and that the Mostar index of split graphs of order

n

is at most

f r a c 427 n^{3}

.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Maximizing the Mostar index for bipartite graphs and split graphs