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 条
[21]  
Gutman I., 1979, MATCH Commun. Math. Comput. Chem., V6, P75
[22]  
Harary F, 1971, J AUSTR MATH SOC, V12, P365
[23]  
HASSELBARTH W, 1977, ISRAEL J CHEM, V15, P112
[24]   THEORY OF MONOMER-DIMER SYSTEMS [J].
HEILMANN, OJ ;
LIEB, EH .
COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1972, 25 (03) :190-&
[25]   CLIQUE POLYNOMIALS AND INDEPENDENT SET POLYNOMIALS OF GRAPHS [J].
HOEDE, C ;
LI, XL .
DISCRETE MATHEMATICS, 1994, 125 (1-3) :219-228
[26]  
Kasteleyn Pieter, 1967, Graph Theory and Theoretical Physics, P43
[27]  
Kerber A, 2002, MATCH-COMMUN MATH CO, P151
[28]  
Kerber A., 1999, APPL FINITE GROUP AC
[29]  
Kerber A., 1991, ALGEBRAIC COMBINATOR
[30]   Permutational isomers on a molecular skeleton with neighbor-excluding ligands [J].
Klein, D. J. ;
Ryhzov, A. ;
Rosenfeld, V. .
JOURNAL OF MATHEMATICAL CHEMISTRY, 2009, 45 (04) :892-909