Terminal Wiener index

Motivated by some recent research on the terminal (reduced) distance matrix, we consider the terminal Wiener index (TW) of trees, equal to the sum of distances between all pairs of pendent vertices. A simple formula for computing TW is obtained and the trees with minimum and maximum TW are characterized.     

Modification of the Wiener index 4

A novel topological index W(F) is defined by the matrices X, W, and L as W(F) = XWL. Where L is a column vector expressing the characteristic of vertices in the molecule; X is a row vector expressing the bonding characteristics between adjacent atoms; W is a reciprocal distance matrix. The topological index W(F), based on the distance-related matrix of a molecular graph, is used to code the structural environment of each atom type in a molecular graph. The good QSPR/QSAR models have been obtained for the properties such as standard formation enthalpy of inorganic compounds and methyl halides, retention indices of gas chromatography of multiple bond-containing hydrocarbons, aqueous solubility, and octanol/water partition of benzene halides. These models indicate that the idea of using multiple matrices to define the modified Wiener index is valid and successful.     

On the Wiener index of a graph

A modification of the Weiner index which properly takes into account the symmetry of a graph is proposed. The explicit formulae for the modified Wiener index of path, cycle, complete bipartite, cube and lattice graphs are derived and compared with their standard Wiener index.     

From Wiener index to molecules

In this paper we present an algorithm for the generation of molecular graphs with a given value of the Wiener index. The high number of graphs for a given value of the Wiener index is reduced thanks to the application of a set of heuristics taking into account the structural characteristics of the molecules. The selection of parameters as the interval of values for the Wiener index, the diversity and occurrence of atoms and bonds, the size and number of cycles, and the presence of structural patterns guide the processing of the heuristics generating molecular graphs with a considerable saving in computational cost. The modularity in the design of the algorithm allows it to be used as a pattern for the development of other algorithms based on different topological invariants, which allow for its use in areas of interest, say as involving combinatorial databases and screening in chemical databases.     

On reciprocal reverse Wiener index

We report some properties, especially bounds for the reciprocal reverse Wiener index of a connected (molecular) graph. We find that the reciprocal reverse Wiener index possesses the minimum values for the complete graph in the class of n-vertex connected graphs and for the star in the class of n-vertex trees, and the maximum values for the complete graph with one edge deleted in the class of n-vertex connected graphs and for the tree obtained by attaching a pendant vertex to a pendant vertex of the star on n − 1 vertices in the class of n-vertex trees. These results are compared with those obtained for the ordinary Wiener index.     

The extremal structures of k-uniform unicyclic hypergraphs on Wiener index

The Wiener index of a connected k-uniform hypergraph is defined as the summation of distances between all pairs of vertices. We determine the unique k-uniform unicyclic hypergraphs with maximum and second maximum, minimum and second minimum Wiener indices, respectively.     

Connections between Wiener index and matchings

Let T be an acyclic molecule with n vertices, and let S(T) be the acyclic molecule obtained from T by replacing each edge of T by a path of length two. In this work, we show that the Wiener index of T can be explained as the number of matchings with n−2 edges in S(T). Furthermore, some related results are also obtained MSC: 05C12 Weigen Yan: This work is supported by FMSTF (2004J024) and NSFF(E0540007) Yeong-Nan Yeh: Partially supported by NSC94-2115-M001-017     

How to compute the Wiener index of a graph

The Wiener index of a graphG is equal to the sum of distances between all pairs of vertices ofG. It is known that the Wiener index of a molecular graph correlates with certain physical and chemical properties of a molecule. In the mathematical literature, many good algorithms can be found to compute the distances in a graph, and these can easily be adapted for the calculation of the Wiener index. An algorithm that calculates the Wiener index of a tree in linear time is given. It improves an algorithm of Canfield, Robinson and Rouvray. The question remains: is there an algorithm for general graphs that would calculate the Wiener index without calculating the distance matrix? Another algorithm that calculates this index for an arbitrary graph is given.     

Determination of the Wiener molecular branching index for the general tree

The many applications of the distance matrix, D(G), and the Wiener branching index, W(G), in chemistry are briefly outlined. W(G) is defined as one half the sum of all the entries in D(G). A recursion formula is developed enabling W(G) to be evaluated for any molecule whose graph G exists in the form of a tree. This formula, which represents the first general recursion formula for trees of any kind, is valid irrespective of the valence of the vertices of G or of the degree of branching in G. Several closed expressions giving W(G) for special classes of tree molecules are derived from the general formula. One illustrative worked example is also presented. Finally, it is shown how the presence of an arbitrary number of heteroatoms in tree-like molecules can readily be accommodated within our general formula by appropriately weighting the vertices and edges of G.     

Ordering chemical unicyclic graphs by Wiener polarity index

Suppose G is a chemical graph with vertex set V(G). Define D(G) = {{u, v} ⊆ V (G) | d _G (u, v) = 3}, where d _G (u, v) denotes the length of the shortest path between u and v. The Wiener polarity index of G, W _p (G), is defined as the size of D(G). In this article, an ordering of chemical unicyclic graphs of order n with respect to the Wiener polarity index is given.     

Relationship between the dynamic viscosity of hydrocarbons and the Wiener topological index

Dependences of the dynamic viscosity on the product of the molecular weight into the Wiener topological index to the 2/3 power are obtained for some hydrocarbons. Relationships between the latter quantity and the parameters of the Frenkel-Andrade equation for the temperature dependence of the dynamic viscosity are established.     

On the relation between W'/W index, hyper-Wiener index, and Wiener numbers

It is shown analytically that the W'/W index, the hyper-Wiener index, and the Wiener number are closely related graph-theoretical invariants for acyclic structures. A general analytical expression for the hyper-Wiener index of a tree is derived too.     

The Mean Isomer Degeneracy of the Wiener Index

The mean isomer degeneracy of the Wiener index was previously shown to become unboundedly large as n (the number of vertices of the molecular graphs of the isomers considered) increases. We here show that there is a high isomer degeneracy in the case of molecules of medium size, namely when n = 6 and n = 7.     

Combinatorial models and algorithms in chemistry. The expanded Wiener number—a novel topological index

An expanded form of the Wiener number is suggested for characterization of molecular graphs and structure-property correlations. The simple, computer-oriented method for counting of the novel index is briefly discussed.     

The Wiener polynomial of a graph

The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some common graphs. We then find a formula for the Wiener polynomial of a dendrimer, a certain highly regular tree of interest to chemists, and show that it is unimodal. Finally, we point out a connection with the Poincaré polynomial of a finite Coxeter group. © 1996 John Wiley & Sons, Inc.     

Trees with the minimum Wiener number

The Wiener number (𝒲) of a connected graph is the sum of distances for all pairs of vertices. As a graphical invariant, it has been found extensive application in chemistry. Considering the family of trees with n vertices and a fixed maximum vertex degree, we derive some methods that can strictly reduce 𝒲 by shifting leaves. And then, by a process, we prove that the dendrimer on n vertices is the unique graph reaching the minimum Wiener number. © 2000 John Wiley & Sons, Inc. Int J Quant Chem 78: 331–340, 2000     

Modification of the Wiener Index. 2

A novel topological index based on the Wiener Index is proposed as W = 1/2, summation(n/ij)=S*(ij) the element S*(ij) of the distance matrix is defined either as S*(ij)= square root (E(i)E(j)/R(ij) (atoms i and j are adjacent) or as S*(ij)=(j-i+1)square root (E(i)...xE /R(ij) (atoms i and j are not adjacent), where E(i) and E(j) represent the total energy of the valence electrons of vertexes i and j, respectively, R(ij) is the sum of the distance between the vertexes i and j in a molecular graph. The distance and the energy of the vertexes in a molecule are taken into account in this definition. Hence the application of the index W to multiple bond and heteroatom-containing organic systems and inorganic systems is possible. Good correlation coefficients are achieved not only in the standard formation enthalpy of methyl halides, halogen-silicon, but also in the retention index of gas chromatography of the hydrocarbons.     

The Wiener distance matrix for acyclic compounds and polymers

The relationship between the Wiener indices and the topological structures of alkanes is analyzed. The expressions for the Wiener distances between elements of these structures are derived, and the distance matrix is constructed for them; this matrix is naturally called the Wiener distance matrix. The expressions for the Wiener indices of polymers with units of arbitrary structure are obtained.