The use of Frame’s method for the characteristic polynomials of chemical graphs

The evaluation of characteristic polynomials of graphs of any size is an extremely tedious problem because of the combinatorial complexity involved in this problem. While particular elegant methods have been outlined for this problem, a general technique for any graph is usually tedious. We show in this paper that the Frame method for the characteristic polynomial of a matrix is extremely useful and can be applied to graphs containing large numbers of vertices. This method reduces the difficult problem of evaluating the characteristic polynomials to a rather simple problem of matrix products. The coefficients in the characteristic polynomial are generated as traces of matrices generated in a recursive product of two matrices. This method provides for an excellent and a very efficient algorithm for computer evaluation of characteristic polynomials of graphs containing a large number of vertices without having to expand the secular determinant of the matrix associated with the graph. The characteristic polynomials of a number of graphs including that of a square lattice containing 36 vertices are obtained for the first time.     

Properties and derivation of the fourth and sixth coefficients of the characteristic polynomial of molecular graphs—New graphical invariants

Some previously unknown relationships for determining the a ₄ and a ₆ coefficients of the characteristic polynomial for polycyclic aromatic hydrocarbons are presented for the first time. The structural information contained in these coefficients is more fully revealed. The equations derived for a ₄ and a ₆ allow one to determine the characteristic polynomial by inspection for many small molecular graphs. Some relationships for a ₈ and a ₁₀ are presented. The set of known graphical invariants (GI) or properties that remain unchanged in isomeric PAH6s is now shown to be GI={a ₄, a ₆+n ₀+2r ₆, a ₈ ^c , d _s+N_Ic, N_c, N_h, N_Ic+N_Pc, q, r}.Part VIII: A periodic table for polycyclic aromatic hydrocarbons     

The characteristic polynomials of structures with pending bonds

It is well known [1] that the calculation of characteristic polynomials of graphs of interest in Chemistry which are of any size is usually extremely tedious except for graphs having a vertex of degree 1. This is primarily because of numerous combinations of contributions whether they were arrived at by non-imaginative expansion of the secular determinant or by the use of some of the available graph theoretical schemes based on the enumeration of partial coverings of a graph, etc. An efficient and quite general technique is outlined here for compounds that have pending bonds (i.e., bonds which have a terminal vertex). We have extended here the step-wise pruning of pending bonds developed for acyclic structures by one of the authors [2] for elegant evaluation of the characteristic polynomials of trees by accelerating this process, treating pending group as a unit. Further, it is demonstrated that this generalized pruning technique can be applied not only to trees but to cyclic and polycyclic graphs of any size. This technique reduces the secular determinant to a considerable extent. The present technique cannot handle only polycyclic structures that have no pending bonds. However, frequently such structures can be reduced to a combination of polycyclic graphs with pending bonds [3] so that the present scheme is applicable to these structures too. Thus we have arrived at an efficient and quite a simple technique for the construction of the characteristic polynomials of graphs of any size.     

The evaluation of the eighth moment for benzenoid graphs

Summary The evaluation of the eighth moment of the adjacency matrix of benzenoid graphs is considered. It is found that the eighth moment can be expressed in terms of 7 graphical invariants. By this we extend the recently obtained results of Hall [1] and Dias [2].     

Note on the topological information content of simple graphs

It is shown that simple graphs gave equal topological information content if their automorphism groups are isomorphic. Further, if the automorphism groups of two graphs are represented by wreath products of which the inner groups are isomorphic, then the two graphs possess equal topological information content. Three graphs which correspond to organic molecules illustrate this finding.Dedicated to Professor Dr.Karl Schlögl on the occasion of his 60th birthday.     

分子轨道图形理论中对称面定理的扩展

对唐敖庆教授和江元生教授建立的对称面定理做了一定的扩展，引进了原子轨道对称性的概念，扩展后的对称面定理可以应用于包含过渡金属和非相邻相互作用等较为复杂的体系中     

Spectral moments of polymer graphs

Summary It is shown that for anyk, thekth spectral moment of a polymer graph composed ofn monomer units is an exact linear function of the parametern. This linear relation holds for all values ofn, greater than a critical value ₀=₀(k).on leave from Faculty of Science, University of Kragujevac     

Reaction graphs and a construction of reaction networks

Summary A general definition of reaction graphs is presented. For a pair of isomeric molecular graphs and , related by a chemical transformation , the reaction graph is determined using a maximal common subgraph defined for vertex mapping . A binary operation defined for graphs constructed over the same vertex set enables us to decompose the reaction graph into the sum of prototype reaction graphs. A decomposition of an overall reaction graph can be advantageously used for the construction of a reaction network. An oriented path in this network beginning at and ending at corresponds to a breakdown of the transformation into a sequence of intermediates.     

Symmetry properties of chemical graphs VIII. On complementarity of isomerization modes

Isomerization mode defines the process of interconversion of one isomer into another. Several mechanisms are conceivable for degenerate rearrangements and, in general, lead to a distinctive network of relations between participating isomers. Here we consider selected modes which are complementary in the sense that if mode 1 transforms an isomer A into B, C, D etc., then mode 2 transforms the same isomer A into X, Y, Z, etc., which includes all isomers not comprised by the first mode. Physico-chemical complementarity can be translated into mathematical complementarity of associated chemical graphs. This allows us to use the tool of Graph Theory. One example of graph theoretical use is the theorem that graph G and its complement G have the same automorphism group (i.e., the same symmetry). We have shown that a close examination of a graph and its complement and their components allows us to recognize the automorphism group in some complex cases without resorting to canonical numbering or other involved procedures, and even allows us to determine isomorphism of different processes.Dedicated to Professor Kurt Mislow of Princeton UniversityOperated for the U.S. Department of Energy by Iowa State University under contract W-7405-Eng-82. Supported in part by the Office of the Director.     

Exact dimer statistics and characteristic polynomials of cacti lattices

Summary The pruning method developed earlier by one of the authors (K.B.) combined with the operator method is shown to yield powerful recursive relations for generating functions for dimer statistics and characteristic polynomials of cacti graphs and cacti lattices. The method developed is applied to linear cacti, Bethe cacti of any length containing rings of any size, and cyclic cacti of any length and size. It is shown that exact dimer statistics can be done on any cactus lattice.Dedicated to Professor V. Krishnamurthy on the occasion of his 60th birthdayAlfred P. Sloan fellow; Camille and Henry Dreyfus teacher-scholar     

Failures of the topological resonance energy method

The topological resonance energy (TRE) is nowadays considered as one of the most reliable indices of stability and aromaticity of conjugated molecules. Seven groups of examples are constructed showing that the TRE concept leads sometimes to obviously false chemical conclusions.Presented on the International Symposium on Aromaticity, Dubrovnik, Yugoslavia, September 1979.     

Analysis of the topological dependency of the characteristic polynomial in its chebyshev expansion

The structural dependency (effect of branching and cyclisation) of an alternative form, the Chebyshev expansion, for the characteristic polynomial were investigated systematically. Closed forms of the Chebyshev expansion for an arbitrary star graph and a bicentric tree graph were obtained in terms of the “structure factor” expressed as the linear combination of the “step-down operator”. Several theorems were also derived for non-tree graphs. Usefulness and effectiveness of the Chebyshev expansion are illustrated with a number of examples. Relation with the topological index (Z _G ) was discussed. Operated for the U.S. Department of Energy by ISU under contract no. W-ENG-7405-82. Supported in part by the Office of Director     

On the calculation of the acyclic polynomial

Graphical methods are developed for recursive evaluation of the acyclic polynomial. Analytical formulas of the acyclic polynomials for several specific series of graphs are given. Mathematical properties of the derivatives of the acyclic polynomial are given.     

Hybrid iodobismuthates code: adapting the geometry of Bi polyhedra to weak interactions

1. Download : Download high-res image (186KB)
2. Download : Download full-size image

     

Burnside Rings: Application to Molecules of Icosahedral Symmetry

The Burnside ring, B(G), of a group G is the set of isomorphism classes of orbits of G together with the operations of addition and product. The addition is defined as the disjoint union, and the product as the Cartesian product. This paper describes basic facts about this algebraic structure and develops some applications in chemistry, as the labelling of atoms in molecules of high symmetry and the construction of symmetry-adapted functions. For illustrating such applications, the concept of Burnside ring is applied to the icosahedral symmetry. Sets of points which are isomorphic to the orbits of the I group are described and the multiplication table of B({I}) is obtained from the table of marks. This multiplication table allows us to obtain an elegant labelling of the atoms of the buckminsterfullerene which is consistent with the icosahedral symmetry. Also, we obtain complete sets of symmetry-adapted functions for the buckminsterfullerene which span the Boyle and Parker's icosahedral representations.     

Operator technique for obtaining the recursion formulas of characteristic and matching polynomials as applied to polyhex graphs

A simple and efficient method, called an operator technique, for obtaining the recurrence relation of a given counting polynomial, e.g., characteristic P_G(x) or matching M_G(x) polynomial, for periodic networks is proposed. By using this technique the recurrence relations of the P_G(x) and M_G(x) polynomials for the linear zigzag-type and kinked polyacene graphs were obtained. For the lower members of these series of graphs, the coefficients of P_G(x) and M_G(x) polynomials are tabulated.     

Discrimination and ordering of chemical structures by the number of walks

The use of the number of walks for the discrimination of graphs representing chemical structures is discussed. A highly selective graph-theoretical index based on the number of walks is defined. The index values were calculated for 661 acyclic and 376 cyclic structures. The selectivity of the new index is compared to that of some of the most selective previously defined indexes. The ordering of structures induced by the value of the index is also considered.Presented in part at the 7th International Conference on Computers in Chemical Research and Education, held in Garmisch-Partenkirchen, Germany, June 10–14, 1985