Key points are not available for this paper at this time.
Abstract We describe a computer method for generating periodic 4-connected frameworks. Given the number of unique tetrahedral atoms and the crystallographic space group type, the algorithm systematically explores all combinations of connected atoms and crystallographic sites, seeking the 4-connected graphs. The resulting symmetry-encoded graphs are relaxed by simulated annealing to identify the regular tetrahedral frameworks. Results are presented for one unique tetrahedral atom in each of the 230 crystallographic space group types. Over 6,400 unique 3-dimensional 4-connected uninodal graphs are found when we restrict our search to those topologies that connect to nearest-neighbour asymmetric units. In any given space group, the number of graphs can depend on the choice of asymmetric unit. About 3% of the 4-connected graphs refine to reasonable tetrahedral conformations, and many are described. There is a combinatorial explosion of graphs as the number of unique vertices is increased, a result which currently restricts this method to consideration of small numbers of unique atoms.
A Sat, study studied this question.