Mostar index and bounded maximum degree

From MaRDI portal




Abstract: Dov{s}li'{c} et al. defined the Mostar index of a graph G as Mo(G)=sumlimitsuvinE(G)|nG(u,v)−nG(v,u)|, where, for an edge uv of G, the term nG(u,v) denotes the number of vertices of G that have a smaller distance in G to u than to v. For a graph G of order n and maximum degree at most Delta, we show Mo(G)leqfracDelta2n2−(1−o(1))cDeltanlog(log(n)), where cDelta>0 only depends on Delta and the o(1) term only depends on n. Furthermore, for integers n0 and Delta at least 3, we show the existence of a Delta-regular graph of order n at least n0 with Mo(G)geqfracDelta2n2−c'Deltanlog(n), where c'Delta>0 only depends on Delta.














This page was built for publication: Mostar index and bounded maximum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440406)