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.     

Analytical expressions for topological properties of polycyclic benzenoid networks

Quantitative structure‐activity and structure‐property relationships of complex polycyclic benzenoid networks require expressions for the topological properties of these networks. Structure‐based topological indices of these networks enable prediction of chemical properties and the bioactivities of these compounds through quantitative structure‐activity and structure‐property relationships methods. We consider a number of infinite convex benzenoid networks that include polyacene, parallelogram, trapezium, triangular, bitrapezium, and circumcorone series benzenoid networks. For all such networks, we compute analytical expressions for both vertex‐degree and edge‐based topological indices such as edge‐Wiener, vertex‐edge Wiener, vertex‐Szeged, edge‐Szeged, edge‐vertex Szeged, total‐Szeged, Padmakar‐Ivan, Schultz, Gutman, Randić, generalized Randić, reciprocal Randić, reduced reciprocal Randić, first Zagreb, second Zagreb, reduced second Zagreb, hyper Zagreb, augmented Zagreb, atom‐bond connectivity, harmonic, sum‐connectivity, and geometric‐arithmetic indices. In addition we have obtained expressions for these topological indices for 3 types of parallelogram‐like polycyclic benzenoid networks.     

Condensed Extended Hyper-Wiener Index

According to the definitions of molecular connectivity and hyper-Wiener index, a novel set of hyper-Wiener indexes （Dn, ^mDn） were defined and named as condensed extended hyper-Wiener index, the potential usefulness of which in QSAR/QSPR is evaluated by its correlation with a number of C3-C8 alkanes as well as by a favorable comparison with models based on molecular connectivity index and overall Wiener index.     

GTI-space: the space of generalized topological indices

A new extension of the generalized topological indices (GTI) approach is carried out to represent “simple” and “composite” topological indices (TIs) in an unified way. This approach defines a GTI-space from which both simple and composite TIs represent particular subspaces. Accordingly, simple TIs such as Wiener, Balaban, Zagreb, Harary and Randić connectivity indices are expressed by means of the same GTI representation introduced for composite TIs such as hyper-Wiener, molecular topological index (MTI), Gutman index and reverse MTI. Using GTI-space approach we easily identify mathematical relations between some composite and simple indices, such as the relationship between hyper-Wiener and Wiener index and the relation between MTI and first Zagreb index. The relation of the GTI-space with the sub-structural cluster expansion of property/activity is also analysed and some routes for the applications of this approach to QSPR/QSAR are also given.     

A new approach for devising local graph invariants: Derived topological indices with low degeneracy and good correlation ability

A new approach is presented for obtaining graph invariants which have very high discriminating ability for different vertices within a graph. These invariants are obtained as the solution set (local invariant set, LOIS) of a system of linear equationsQ · X = R, whereQ is a topological matrix derived from the adjacency matrix of the graph, andR is a column vector which encodes either a topological property (vertex degree, number of vertices in the graph, distance sum) or a chemical property (atomic number). Twenty examples of LOOIs are given and their degeneracy and ordering ability of vertices is discussed. Interestingly, in some cases the ordering of vertices obtained by means of these invariants parallels closely the ordering from an entirely different procedure based on Hierarchically Ordered Extended Connectivities which was recently reported. New topological indices are easily constructed from LOISs. Excellent correlations are obtained for the boiling points and vaporization enthalpies of alkanesversus the topological index representing the sum of local vertex invariants. Les spectacular correlations with NMR chemical shifts, liquid phase density, partial molal volumes, motor octane numbers of alkanes or cavity surface areas of alcohols emphasize, however, the potential of this approach, which remains to be developed in the near future.     

Trees with the same Topological Index JJ

Abstract

In the present paper we investigate the trees with the same JJ index (called JJ-equivalent trees). The topological index JJ is derived from the so called Wiener matrix introduced by Randic et al., in 1994. The Wiener matrix is constructed by generalizing the procedure of Wiener for evaluation of Wiener numbers in alkanes. From such matrices several novel structural invariants of potential interest in structure-property studies were obtained. These include higher Wiener numbers, Wiener sequences, and hyper-Wiener number, etc. The topological index JJ is constructed by considering the row sums of the Wiener matrix. A construction method for a class of JJ-equivalent trees is given. By using this method we construct the smallest pairs of non-isomorphic JJ-equivalent trees which have 18 vertices. In addition we report on groups of 3,4, and 6 non-isomorphic JJ-equivalent trees. The smallest such trees are of size 28 for triples and quadruples, and 34 for the group of 6 elements.     

On the geometric–arithmetic index by decompositions-CMMSE

The concept of geometric–arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. There are many papers studying different kinds of indices (as Wiener, hyper–Wiener, detour, hyper–detour, Szeged, edge–Szeged, PI, vertex–PI and eccentric connectivity indices) under particular cases of decompositions. The main aim of this paper is to show that the computation of the geometric-arithmetic index of a graph G is essentially reduced to the computation of the geometric-arithmetic indices of the so-called primary subgraphs obtained by a general decomposition of G. Furthermore, using these results, we obtain formulas for the geometric-arithmetic indices of bridge graphs and other classes of graphs, like bouquet of graphs and circle graphs. These results are applied to the computation of the geometric-arithmetic index of Spiro chain of hexagons, polyphenylenes and polyethene.     

Wiener, hyper-Wiener, detour and hyper-detour indices of bridge and chain graphs

Given a collection of connected graphs one may build bridge and chain graphs out of them. In this paper it is shown how the Wiener, hyper-Wiener, detour and hyper-detour indices for bridge and chain graphs are determined from the respective indices of the individual graphs. The results obtained are illustrated by some examples.     

Generalized Wiener indices in hexagonal chains

The Wiener index, or the Wiener number, also known as the “sum of distances” of a connected graph, is one of the quantities associated with a molecular graph that correlates nicely to physical and chemical properties, and has been studied in depth. An index proposed by Schultz is shown to be related to the Wiener index for trees, and Ivan Gutman proposed a modification of the Schultz index with similar properties. We deduce a similar relationship between these three indices for catacondensed benzenoid hydrocarbons (graphs formed of concatenated hexagons, or hexagonal chains, or sometimes acenes). Indeed, we may define three families of generalized Wiener indices, which include the Schultz and Modified Schultz indices as special cases, such that similar explicit formulae for all generalized Wiener indices hold on hexagonal chains. We accomplish this by first giving a more refined proof of the formula for the standard Wiener index of a hexagonal chain, then extending it to the generalized Wiener indices via the notion of partial Wiener indices. Finally, we discuss possible extensions of the result. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2006     

Wiener indices of trees and monocyclic graphs with given bipartition

The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. It has found various applications in chemical research. We determine the minimum and the maximum Wiener indices of trees with given bipartition and the minimum Wiener index of monocyclic graphs with given bipartition, respectively. We also characterize the graphs whose Wiener indices attain these values. © 2011 Wiley Periodicals, Inc. Int J Quantum Chem, 2012     

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.