Academia.eduAcademia.edu

Outline

Enumeration and generation of three-center valence structures

1974, Journal of the American Chemical Society

https://doi.org/10.1021/JA00816A007

Abstract

The problem of enumerating and generating valence structures for molecules containing both two-center and three-center bonds is discussed. Two formal solutions in terms of an integer programming problem and a polynomial representation are suggested. A construction algorithm and a chemically suggestive variant of it are developed and discussed. n electron-deficient molecules, particularly in boron I hydrides and carboranes, topological methods which utilize the three-center bond concept have given useful descriptions of both s t r ~c t u r e ~' ~ and rea~tivity.~ An important element of such methods is the enumeration and/or generation of all allowed three-center valence structures for a given configuration of atomic nuclei. The problem of counting Kekulk structures in conjugated hydrocarbons was considered by CvetkoviC, Gutman, and TrinajstiC,6 who obtained an expression for the number of such structures as the permanent of an adjacency matrix. Hosoya' has given a polynomial representation for the numbers of KekulC and Dewar structures of even alternant hydrocarbons. The problem which we consider here8 is: can we obtain analogous, relatively simple procedures for enumerating valence structures for boron hydrides, in which there are three-center as well as two-center bonds? A computer program for the enumeration of such structures has been developed by Epstein. However, the approach employed was both enumerative and exhaustive, in that all possible combinations of twoand three-center bonds must be generated and evaluated. We seek here approaches that are more efficient timewise and hence render isomer enumeration practicable and convenient for quite large molecules even without the aid of a computer. In the next section we describe the three-center valence structure enumeration problem. We then obtain results of two kinds. First we exhibit two alternative formal representations of the enumeration problem as a covering problem. Then we describe a constructive algorithm for performing the enumeration that renders the problem accessible to hand computation even for molecules as large as BI6H2,,, for which the computer ( I ) (a) Brandeis University; (b) Massachusetts Institute of Technology. (2) (a) H. C. Longuet-Higgins,