Mostar index and bounded maximum degree
From MaRDI portal
Abstract: Dov{s}li'{c} et al. defined the Mostar index of a graph as , where, for an edge of , the term denotes the number of vertices of that have a smaller distance in to than to . For a graph of order and maximum degree at most , we show where only depends on and the term only depends on . Furthermore, for integers and at least , we show the existence of a -regular graph of order at least with where only depends on .
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)