The Wiener index of a graph W(G) is well studied topological for graphs. An outstanding problem Šoltés to find graphs G such that W(G)=W(G−v) all vertices v∈V(G), with the only known example being G=C11. We relax this by defining notion indices signed graphs, which we denote Wσ(G), and under relaxation construct many Wσ(G)=Wσ(G−v) v∈V(G). This ends up related independent interest, asks when it ...

two sides of the edge e, and where the summation goes over all edges of T . The λ -modified Wiener index is defined as Wλ (T ) = ∑ e [nT,1(e) · nT,2(e)] . For each λ > 0 and each integer d with 3 ≤ d ≤ n− 2, we determine the trees with minimal λ -modified Wiener indices in the class of trees with n vertices and diameter d. The reverse Wiener index of a tree T with n vertices is defined as Λ (T)...

Complex networks abound in physical, biological and social sciences. Quantifying a network's topological structure facilitates network exploration and analysis, and network comparison, clustering and classification. A number of Wiener type indices have recently been incorporated as distance-based descriptors of complex networks, such as the R package QuACN. Wiener type indices are known to depe...

Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...

The Wiener index W (G) of a connected graph G is defined as W (G) = ∑ u,v∈V (G) dG(u, v) where dG(u, v) is the distance between the vertices u and v of G. For S ⊆ V (G), the Steiner distance d(S) of the vertices of S is the minimum size of a connected subgraph of G whose vertex set is S. The k-th Steiner Wiener index SWk(G) of G is defined as SWk(G) = ∑ S⊆V (G) |S|=k d(S). We establish expressi...

The edge versions of reverse Wiener indices were introduced by Mahmiani et al. very recently. In this paper, we find their relation with ordinary (vertex) Wiener index in some graphs. Also, we compute them for trees and TUC4C8(s) naotubes.

Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...