Abstract
Došlić et al. defined the Mostar index of a graph G as ∑uv∈E(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. Contributing to conjectures posed by Došlić et al., we show that the Mostar index of bipartite graphs of order n is at most 318n3, and that the Mostar index of split graphs of order n is at most 427n3.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
