The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...

In 1993 two novel distance-based topological indices were put forward. In the case of acyclic molecular graphs both are equal to the Wiener index, but both differ from it if the graphs contain cycles. One index is defined (Mohar, B.; Babić, D.; Trinajstić, N. J. Chem. Inf. Comput. Sci. 1993, 33, 153-154) in terms of eigenvalues of the Laplacian matrix, whereas the other is conceived (Klein, D. ...

In this paper, we consider a molecular descriptor called the Wiener polarity index, which is defined as the number of unordered pairs of vertices at distance three in a graph. Molecular descriptors play a fundamental role in chemistry, materials engineering, and in drug design since they can be correlated with a large number of physico-chemical properties of molecules. As the main result, we de...

The Wiener–Khintchine formula plays a central role in statistical mechanics. It is shown here that the problem of prime pairs is related to autocorrelation and hence to a Wiener–Khintchine formula. “Experimental” evidence is given for this. c © 1999 Elsevier Science B.V. All rights reserved. PACS: 05.40+j; 02.30.Nw; 02.10.Lh

Anthropogenic Biomes describe globally significant ecological patterns within the terrestrial biosphere caused by sustained direct human interaction with ecosystem, including agriculture, urbanization, forestry and other land uses. The present study focused on the invertebrate diversity in Marudhamalai Hills which is highly disturbed by human activities. Different techniques to identify the dis...

The Wiener number W (G) of a graph G is the sum of distances between all pairs of vertices of G. If (G,w) is a vertex-weighted graph, then the Wiener number W (G,w) of (G,w) is the sum, over all pairs of vertices, of products of weights of the vertices and their distance. For G being a partial binary Hamming graph, a formula is given for computing W (G,w) in terms of a binary Hamming labeling o...

Asymptotics are obtained for the mean, variance and higher moments as well as for the distribution of the Wiener index of a random tree from a simply generated family (or, equivalently, a critical Galton– Watson tree). We also establish a joint asymptotic distribution of the Wiener index and the internal path length, as well as asymptotics for the covariance and other mixed moments. The limit l...

Abstract. Applications of isometric embeddings of benzenoid graphs are surveyed. Their embeddings into hypercubes provide methods for computing the Wiener index and the Szeged index, while embeddings into the Cartesian product of trees lead to fast algorithms. A new method for computing the hyperWiener index of partial cubes in general, and of benzenoid graphs and trees in particular, is also p...

In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the present paper, we study these topological indices with respect to their difference number.