Common vertex matrix: A novel characterization of molecular graphs by counting

We present a novel matrix representation of graphs based on the count of equal‐distance common vertices to each pair of vertices in a graph. The element (i, j) of this matrix is defined as the number of vertices at the same distance from vertices (i, j). As illustrated on smaller alkanes, these novel matrices are very sensitive to molecular branching and the distribution of vertices in a graph. In particular, we show that ordered row sums of these novel matrices can facilitate solving graph isomorphism for acyclic graphs. This has been illustrated on all undecane isomers C₁₁H₂₄ having the same path counts (total of 25 molecules), on pair of graphs on 18 vertices having the same distance degree sequences (Slater's graphs), as well as two graphs on 21 vertices having identical several topological indices derived from information on distances between vertices. © 2013 Wiley Periodicals, Inc.     

A generalized graph-theoretical matrix of heterosystems and its application to the VMV procedure

The extensions of generalized (molecular) graph-theoretical matrix and vector-matrix-vector procedure are considered. The elements of the generalized matrix are redefined in order to describe molecules containing heteroatoms and multiple bonds. The adjacency, distance, detour and reciprocal distance matrices of heterosystems, and corresponding vectors are derived from newly defined generalized graph matrix. The topological indices, which are most widely used in predicting physicochemical and biological properties/activities of various compounds, can be calculated from the new generalized vector-matrix-vector invariant.     

Molecular Graph Matrices and Derived Structural Descriptors

Abstract

A number of recently graph matrices encoding in various ways the topological information is presented. Four graph operators are used to compute 19 topological indices for a set of 306 alkanes. The intercorrelation coefficients of the 19 topological indices are computed and used to identify highly intercorrelated indices.     

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.     

Redefining the terminology of stereoisomerism to produce a mathematics-based taxonomy paradigm

The traditional energy-based taxonomy of stereoisomers is replaced by a geometry-based one. A new paradigm using positive, rather than negative, definition of important terms such as diastereoisomers, and amenable to higher coordination and to incorporating newer taxonomy classes, such as topological isomers, is proposed. Using graph theoretical distance, as well as an additional layer of choice regarding metric distance in a standardized model, key terms, such as configuration vs. conformation, are redefined; also ‘antiquated’ terms, such as ‘geometrical’ isomerism, are reconstituted and given an important place in modern chemistry.     

Correlations of indices calculated from the matrix of maximal topological distances with boiling points of alkylbenzenes

The matrix of maximal topological distances of a graph can serve as a basis for constructing new topological indices of ringcontaining structures. A comparative study of the structureproperty correlations of the indices of the matrix of maximal topological distances and known Wiener, Horary, and Schultz indices (instructive sample of 29 alkylbenzenes) showed that the best two- and three-parameter correlations with boiling points include the indices of the maximal distance matrix. The two-parameter (r = 0.0992, s = 3.5) and three-parameter (r = 0.994, s = 3.1) correlations may be used for quantitative predictions of the boiling points of alkylbenzenes. Translated fromZhumal Struktumoi Khimii, Vol. 38, No. 1, pp. 167–172, January–February, 1997.     

Topological characterization of cyclic structures

The sum of the topological distances in the molecular graph (the Wiener number) is used for a topological characterization of the condensed polycyclic molecular systems. This topological index discriminates well the isomeric cyclic molecules. In addition, it also properly reflects their structural features. On this basis the principal points of molecular cyclicity are formulated in 15 rules.     

Degeneracy of some matrix graph invariants

New matrices associated with graphs and induced global and local topological indices of molecular graphs were proposed recently by Diudea, Minailiuc and Balaban. These matrices in canonical form are matrix graph invariants. A combined degeneracy of such invariants is considered. For every case of degeneracy corresponding graphs are presented.     

The overall Wiener index--a new tool for characterization of molecular topology.

Recently, the concept of overall connectivity of a graph G, TC(G), was introduced as the sum of vertex degrees of all subgraphs of G. The approach of more detailed characterization of molecular topology by accounting for all substructures is extended here to the concept of overall distance OW(G) of a graph G, defined as the sum of distances in all subgraphs of G, as well as the sum of eth-order terms, (e)OW(G), with e being the number of edges in the subgraph. Analytical expressions are presented for OW(G) of several basic classes of graphs. The overall distance is analyzed as a measure of topological complexity in acyclic and cyclic structures. The potential usefulness of the components of this generalized Wiener index in QSPR/QSAR is evaluated by its correlation with a number of properties of C3-C8 alkanes and by a favorable comparison with models based on molecular connectivity indices.     

On the similarity of DNA primary sequences

We consider numerical characterization of graphical representations of DNA primary sequences. In particular we consider graphical representation of DNA of beta-globins of several species, including human, on the basis of the approach of A. Nandy in which nucleic bases are associated with a walk over integral points of a Cartesian x, y-coordinate system. With a so-generated graphical representation of DNA, we associate a distance/distance matrix, the elements of which are given by the quotient of the Euclidean and the graph theoretical distances, that is, through the space and through the bond distances for pairs of bases of graphical representation of DNA. We use eigenvalues of so-constructed matrices to characterize individual DNA sequences. The eigenvalues are used to construct numerical sequences, which are subsequently used for similarity/dissimilarity analysis. The results of such analysis have been compared and combined with similarity tables based on the frequency of occurrence of pairs of bases.     

Topographical distance matrices for porous arrays

The topographical Wiener index is calculated for two-dimensional graphs describing porous arrays, including bee honeycomb. For tiling in the plane, we model hexagonal, triangular, and square arrays and compare with topological formulas for the Wiener index derived from the distance matrix. The normalized Wiener indices of C₄, T₁₃, and O(4), for hexagonal, triangular, and square arrays are 0.993, 0.995, and 0.985, respectively, indicating that the arrays have smaller bond lengths near the center of the array, since these contribute more to the Wiener index. The normalized Perron root (the first eigenvalue, λ ₁), calculated from distance/distance matrices describes an order parameter, f = l₁/n{\phi=\lambda_1/n} , where f = 1{\phi= 1} for a linear graph and n is the order of the matrix. This parameter correlates with the convexity of the tessellations. The distributions of the normalized distances for nearest neighbor coordinates are determined from the porous arrays. The distributions range from normal to skewed to multimodal depending on the array. These results introduce some new calculations for 2D graphs of porous arrays.     

Graph theoretical similarity approach to compare molecular electrostatic potentials

In this work we introduce a graph theoretical method to compare MEPs, which is independent of molecular alignment. It is based on the edit distance of weighted rooted trees, which encode the geometrical and topological information of Negative Molecular Isopotential Surfaces. A meaningful chemical classification of a set of 46 molecules with different functional groups was achieved. Structure--activity relationships for the corticosteroid binding affinity (CBG) of 31 steroids by means of hierarchical clustering resulted in a clear partitioning in high, intermediate, and low activity groups, whereas the results from quantitative structure--activity relationships, obtained from a partial least-squares analysis, showed comparable or better cross-validated correlation coefficients than the ones reported for previous methods based solely in the MEP.     

The multiplicative version of the Wiener index

The classical Wiener index, W(G), is equal to the sum of the distances between all pairs of vertexes of a (molecular) graph, G. We now consider a related topological index, pi(G), equal to the product of distances between all pairs of vertexes of G. The basic properties of the pi index are established and its possible physicochemical applications examined. In the case of alkanes, pi and W are highly correlated; a slightly curvilinear correlation exists between In pi and W.     

Topological analysis of eigenvectors of the adjacency matrices in graph theory: The concept of internal connectivity

The topological properties of eigenvectors of adjacency matrices of a graph have been analyzed. Model systems studied are n-vertex-m-edge (n-V-m-E) graphs where n = 2–4, m = 1–6. The topological information contained in these eigenvectors is described using vertex-signed and edge-signed graphs. Relative ordering of net signs of edge-signed graphs is similar to that of eigenvalues of the adjacency matrix. This simple analysis has also been applied to naphthalene, anthracene and pyrene. It provides a sound basis for the application of graph theory to molecular orbital theory.