Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts

被引:8
作者
Rosenfeld, Vladimir R. [1 ]
Klein, Douglas J. [1 ]
机构
[1] Texas A&M Univ, Dept Marine Sci, Math Chem Grp, Galveston, TX 77553 USA
关键词
Enumeration; Substitutional isomers; Constrained substitution; Symmetry-reduced counting polynomials; DOUBLE COSETS; GRAPHS;
D O I
10.1007/s10910-012-0056-0
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
We address systematics for the enumeration of substitutional isomers when there is constrained positioning of ligands on a molecular skeleton. One constraint involves 'restrictive ligands' where two of the same kind are forbidden to occupy adjacent sites in a molecular skeleton. This may arise because of steric hindrance, or because of groups which in neighbor proximity react to eliminate one. For instance, no pair of -OH groups attach to the same C atom in a molecular skeleton. In another case, malonic acid residues decarboxylate leaving no more than one decarboxylation in each residue. The enumeration with such restrictive ligands may be addressed via a Polya-theoretic cycle index hybridized with the graph-theoretic independence polynomial (when there is just a single such neighbor-excluding ligand and another which is not), while more generally a hybridization with the chromatic polynomial is needed. Another substitional-isomer constraint involves bidentate ligands, with each ligand-part occupying adjacent sites, and possibly also with additional separate unidentate ligands. Here, the set of all pure & mixed such ligand placements is analytically represented by a 'symmetry-reduced' matching polynomial (which is a hybrid now of the matching polynomial and Polya's cycle index). This result gives the generating function for isomer enumeration, taking into account every possible so-restricted assortment of the employed ligands. Here we make such novel hybridizations (for these and other graphtheoretic polynomials) to deal with such oft-encountered chemical problems, which nevertheless transcend typical earlier unconstrained formulizations. Further subsymmetry classification & enumerations, along with examples are considered in a further article.
引用
收藏
页码:21 / 37
页数:17
相关论文
共 57 条
[1]  
[Anonymous], 1973, GRAPHICAL ENUMERATIO
[2]  
Balaban A.T., 1976, Chemical Applications of Graph Theory
[3]   APPLICATIONS OF COMBINATORICS AND GRAPH-THEORY TO SPECTROSCOPY AND QUANTUM-CHEMISTRY [J].
BALASUBRAMANIAN, K .
CHEMICAL REVIEWS, 1985, 85 (06) :599-618
[4]  
Beineke L.W., 1970, J. Combin. Th. Ser B, V9, P129
[5]  
Beineke L.W., 1968, Beitrage zur Graphentheorie, P17
[6]  
Birkhoff GD., 1912, Ann. Math, V14, P42, DOI [DOI 10.2307/1967597, 10.2307/1967597]
[7]   ICOSAHEDRAL IRREDUCIBLE TENSORS AND THEIR APPLICATIONS [J].
BOYLE, LL ;
OZGO, Z .
INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 1973, 7 (02) :383-404
[8]  
De Bruijn N.G., 1971, NIEUW ARCHIEF WISKUN, V19, P89
[9]  
El-Basil S, 1999, COMBINATORIAL ORGANI
[10]  
Farrell E. J., 1982, CARIBEAN J MATH, V2, P15