4 research outputs found
Computing the Mostar index in networks with applications to molecular graphs
Recently, a bond-additive topological descriptor, named as the Mostar index,
has been introduced as a measure of peripherality in networks. For a connected
graph , the Mostar index is defined as , where for an edge we denote by the number of
vertices of that are closer to than to and by the number
of vertices of that are closer to than to . In this paper, we
generalize the definition of the Mostar index to weighted graphs and prove that
the Mostar index of a weighted graph can be computed in terms of Mostar indices
of weighted quotient graphs. As a consequence, we show that the Mostar index of
a benzenoid system can be computed in sub-linear time with respect to the
number of vertices. Finally, our method is applied to some benzenoid systems
and to a fullerene patch
Computing weighted Szeged and PI indices from quotient graphs
The weighted Szeged index and the weighted vertex-PI index of a connected
graph are defined as and , respectively, where denotes the number of vertices
closer to than to and denotes the number of vertices closer to
than to . Moreover, the weighted edge-Szeged index and the weighted PI
index are defined analogously. As the main result of this paper, we prove that
if is a connected graph, then all these indices can be computed in terms of
the corresponding indices of weighted quotient graphs with respect to a
partition of the edge set that is coarser than the -partition. If
is a benzenoid system or a phenylene, then it is possible to choose a partition
of the edge set in such a way that the quotient graphs are trees. As a
consequence, it is shown that for a benzenoid system the mentioned indices can
be computed in sub-linear time with respect to the number of vertices.
Moreover, closed formulas for linear phenylenes are also deduced. However, our
main theorem is proved in a more general form and therefore, we present how it
can be used to compute some other topological indices
On the difference between the Szeged and Wiener index
We prove a conjecture of Nadjafi-Arani, Khodashenas and Ashrafi on the
difference between the Szeged and Wiener index of a graph. Namely, if is a
2-connected non-complete graph on vertices, then .
Furthermore, the equality is obtained if and only if is the complete graph
with an extra vertex attached to either or vertices of
. We apply our method to strengthen some known results on the
difference between the Szeged and Wiener index of bipartite graphs, graphs of
girth at least five, and the difference between the revised Szeged and Wiener
index. We also propose a stronger version of the aforementioned conjecture
General cut method for computing Szeged-like topological indices with applications to molecular graphs
Szeged, PI and Mostar indices are some of the most investigated
distance-based molecular descriptors. Recently, many different variations of
these topological indices appeared in the literature and sometimes they are all
together called Szeged-like topological indices. In this paper, we formally
introduce the concept of a general Szeged-like topological index, which
includes all mentioned indices and also infinitely many other topological
indices that can be defined in a similar way. As the main result of the paper,
we provide a cut method for computing a general Szeged-like topological index
for any strength-weighted graph. This greatly generalizes various methods known
for some of the mentioned indices and therefore rounds off such investigations.
Moreover, we provide applications of our main result to benzenoid systems,
phenylenes, and coronoid systems, which are well-known families of molecular
graphs. In particular, closed-form formulas for some subfamilies of these
graphs are deduced