On Mostar index of trees with parameters

Abstract

The Mostar index of a graph G is defined as the sum of absolute values of the differences between n u and n v over all edges uv of G, where n u and n v are respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u. We identify those trees with minimum and/or maximum Mostar index in the families of trees of order n with fixed parameters like the maximum degree, the diameter, number of pendent vertices by using graph transformations that decrease or increase the Mostar index.

Computation of entropy measures for phthalocyanines and porphyrins dendrimers

“…For further details, see Arockiaraj et al [46][47][48][49]. To compute the above bond-additive indices, we will use the cut method [50,51].…”

Computation of Mostar index for some graph operations

“…The precise values of this index for the families of coronoid structures and carbon nanocones are presented in Djoković [28]. The extremal results have been discussed for the cacti and trees in Hayat et al [29, 30]. Recently, by using graph operations, Mostar indices of nanostructures and chemical structures are computed in References [31, 32].…”

Mostar indices of SiO2 nanostructures and melem chain nanostructures

“…[23]. Hayat and Zhou gave the expressions of this index for the cacti and trees in refs [24,25]. Recently, by using graph operations, Mostar indices of nanostructures and chemical structures have been computed in ref.…”