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 条
[41]  
Polya G., 1987, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
[42]  
ROSENFELD R., 1989, MATCH-COMMUN MATH CO, V24, P191
[43]  
Rosenfeld V.R, 1991, P 6 CAR C GRAPH THEO, P240
[44]  
Rosenfeld V. R., 2002, INTERNET ELECT J MOL, V1, P142
[45]  
Rosenfeld V.R, 1988, CALCULATIONAL METHOD, P15
[46]   The circuit polynomial of the restricted rooted product G (Γ) of graphs with a bipartite core G [J].
Rosenfeld, Vladimir R. .
DISCRETE APPLIED MATHEMATICS, 2008, 156 (04) :500-510
[47]  
Rosenfeld VR, 2001, MATCH-COMMUN MATH CO, P111
[48]  
ROSENFELD VR, 1982, RESOLVING COMBINATOR
[49]  
ROSENFELD VR, 1991, COLL SCI PAPERS FS K, V12, P49
[50]  
Rota G.-C., 1977, ANN SCUOLA NORM SU 4, V4, P637