On reciprocal molecular topological index

We report some properties of the reciprocal molecular topological index RMTI of a connected graph, and, in particular, its relationship with the first Zagreb index M₁. We also derive the upper bounds for RMTI in terms of the number of vertices and the number of edges for various classes of graphs, including K _r+1 -free graphs with r ≥ 2, quadrangle-free graphs, and cacti. Additionally, we consider a Nordhaus-Gaddum-type result for RMTI.     

Domain‐Averaged Exchange‐Correlation Energies as a Physical Underpinning for Chemical Graphs

A novel solution to the problem of assigning a molecular graph to a collection of nuclei (i.e. how to draw a molecular structure) is presented. Molecules are universally understood as a set of nuclei linked by bonds, but establishing which nuclei are bonded and which are not is still an empirical matter. Our approach borrows techniques from quantum chemical topology, which showed for the first time the construction of chemical graphs from wave functions, shifting the focus on energetics. This new focus resolves issues surrounding previous topological analyses, in which domain‐averaged exchange‐correlation energies (V_xc), quantities defined in real space between each possible atom pair, hold the key. Exponential decay of V_xc in non‐metallic systems as the intercenter distance increases guarantees a well‐defined hierarchy for all possible V_xc values in a molecule. Herein, we show that extracting the set of atom pairs that display the largest V_xc values in the hierarchy is equivalent to retrieving the molecular graph itself. Notably, domain‐averaged exchange‐correlation energies are transferable, and they can be used to calculate bond strengths. Fine‐grained details resulted to be related to simple stereoelectronic effects. These ideas are demonstrated in a set of simple pilot molecules.     

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.     

Discrimination of isomeric structures using information theoretic topological indices

Three newly defined information theoretic topological indices, namely “degree complexity (I^d),” “graph vertex complexity (H^V),” and “graph distance complexity (H^D)” along with three other information indices have been used to study their discriminating power of 45 trees and 19 monocyclic graphs. It is found that the newly defined indices have satisfactory discriminating power while H^D has been found to be the only index to discriminate all the graphs studied.     

Generalized graphs and the Sinanoğlu graphical rules

A comparison of Sinano?lu's VIF (Ref. 1) and generalized graph is presented. Generalized graphs have vertex and edge weights. An abridged history of generalized graphs in theoretical chemistry is given. VIF 's are generalized graphs and therefore have adjacency matrices. The “graphical” rules of Sinano?lu can be represented by congruent transformations on the adjacency matrix. Thus the method of Sinano?lu is incorporated into the broad scheme of graph spectral theory. If the signature of a graph is defined as the collection of the number of positive, zero, and negative eigenvalues of the graph's adjacency matrix, then it is identical to the all-important {n₊, n₀, n_?}, the {number of positive, zero, and negative loops of a reduced graph} or the {number of bonding, nonbonding, and antibonding MO s}. A special case of the Sinano?lu rules is the “multiplication of a vertex” by (?1). In matrix language, this multiplication is an orthogonal transformation of the adjacency matrix. Thus, one can multiply any vertex of a generalized graph by ?1 without changing its eigenvalues.     

A representation of the McClelland method of graph splitting. Stack graphs

McClelland's rules on graph splitting can be represented using the generalized graph notation. Generalized graphs are edge- and vertex-weighted graphs, which are becoming important to chemical problems. By this the McClelland method of graph splitting has a wider range of applications. “Stack graphs” are constructed from identical “base graphs” by connecting corresponding vertices from one base to another. Their eigenvalues are related to the eigenvalues of the base graph. Two- and even three-layered graphs may be used as a simple model for the inter-ring interaction in a cyclophane.     

Scaffold topologies. 1. Exhaustive enumeration up to eight rings

Mapping the chemical space of small organic molecules is approached from a theoretical graph theory viewpoint, in an effort to begin the systematic exploration of molecular topologies. We present an algorithm for exhaustive generation of scaffold topologies with up to eight rings and an efficient comparison method for graphs within this class. This method uses the return index, a topological invariant derived from the adjacency matrix of the graph. Furthermore, we describe an algorithm that verifies the adequacy of the comparison method. Applications of this method for chemical space exploration in the context of drug discovery are discussed. The key result is a unique characterization of scaffold topologies, which may lead to more efficient ways to query large chemical databases.     

The Pyrolysis of Azides in the Gas Phase

The chemistry of the non-metallic elements has in recent years passed through a period of rapid development, often referred to as its “renaissance”. To emphasize just one of the key facets: numerous short-lived molecules containing multiple bonds to elements of the third and higher periods have been discovered, often accompanied by the planned synthesis of derivatives which are sterically shielded by bulky groups and thus kinetically stabilized. Thus today molecules such as silabenzenes H₆C_6?nSi_n and silaethenes H₂Si?CH₂ or R₂Si?CR₂, disilenes R₂Si?SiR₂ and diphosphenes RP?PR, silaphenylisonitrile H₅C₆? N?Si, or methylidyne-phosphanes R? C?P, are all well-known species. Sandwich compounds with P₆ rings or silicon centers demonstrate that there are now hardly any barriers to impede the imagination of the non-metal chemist. In sharp contrast is our lack of knowledge regarding the “microscopic” pathways of chemical reactions: thus apart from information provided for example by molecular beam experiments, or from exact numerical calculations involving species consisting of only a few atoms, it remains largely unknown from which directions medium-sized molecules must approach each other to successfully collide and form a “reaction complex”, in which way their structures are changed in such a process or which role is played by molecular dynamics in the energy transfer.–The pyrolysis of azides X? N₃, i.e. compounds which tend to explode violently when ignited in the condensed phase but can be heated in low-pressure gas flow systems without much risk, illustrates that studies of reactive intermediates are of interest not only because novel molecules may be discovered and isolated, and thereby possibilities for synthesis expanded. Moreover, some aspects of the “microscopic” pathways of these azide pyrolyses can be described satisfactorily on the basis of calculated energy hypersurfaces, and the influence of molecular dynamics becomes experimentally visible in the “chemical activation” of intermediates which leads to their “thermal explosion”.     

Linear Free‐Energy Relationships between a Single Gas‐Phase Ab Initio Equilibrium Bond Length and Experimental pKa Values in Aqueous Solution

Remarkably simple yet effective linear free energy relationships were discovered between a single ab initio computed bond length in the gas phase and experimental pK_a values in aqueous solution. The formation of these relationships is driven by chemical features such as functional groups, meta/para substitution and tautomerism. The high structural content of the ab initio bond length makes a given data set essentially divide itself into high correlation subsets (HCSs). Surprisingly, all molecules in a given high correlation subset share the same conformation in the gas phase. Here we show that accurate pK_a values can be predicted from such HCSs. This is achieved within an accuracy of 0.2 pK_a units for 5 drug molecules.     

On the three-fold irregular branched coverings of spatial four-valent graphs and its applications

LetL be a spatial four-valent graph. Then one of the effective tools for studying the topological position ofL in the 3-sphere is to consider the three-fold irregular branched coverings ofL [1]. In this paper we will show that this technique can also be applied to some hypothetical three-valent molecular graphs in topological stereochemistry.     

Functional groups expressed as graphs extracted from the Laplacian of the electron density

The valence charge concentration shell, as determined by the Laplacian of the electron density, is used as a source of quantum topological graphs, called L‐graphs. A considerable number of such graphs are extracted from the ab initio wave functions of 31 molecules calculated at the B3LYP/6‐311+G(2d,p)//B3LYP/6‐311+G(2d,p) level, covering common functional groups in organic chemistry. We show how L‐graphs can be constructed from a largely transferable subgraph called atomic L‐graph. We investigate the topological stability of the L‐graphs as a function of the basis set. Reliable and consistent atomic L‐graphs are only obtained with basis sets of triple‐zeta quality or higher. The recurrence of invariant motifs or subgraphs in the L‐graphs enables the isolation of 16 atomic L‐graphs. © 2003 Wiley Periodicals, Inc. Int J Quantum Chem, 2003     

Calculation of the coefficients of the characteristic polynomial from its subgraphs

The characteristic polynomial associated with π-electrons of conjugated molecules are discussed by using subgraphs derived from molecular graphs as a basis for their construction. A practical method has been developed for evaluating the coefficient a_K of conjugated molecules. Applying this method, the general formulas of evaluating the coefficient a_K for homologous conjugated molecules have been obtained. The approach is illustrated on a few simple conjugated systems, including also a few polymeric systems. © 1996 John Wiley & Sons, Inc.