An efficient method for determining zeolite vertex symbols

We present an efficient method for computing the topological vertex symbols of zeolite frameworks. The algorithm gets its efficiency by dividing the problem into a sequence of quickly executed breadth-first searches. For small rings (fewer than eight vertices), we find there is no speed gain compared with a distance table approach, both methods executing quickly. The main benefits occur for large rings, or when no ring exists, a situation that forces a fruitless search over the full model domain. In this situation, our method is typically 60 times faster.

[1]  P. Voyles,et al.  Schläfli cluster topological analysis of medium range order in paracrystalline amorphous semiconductor models , 2000 .

[2]  Igor Rivin,et al.  Enumeration of periodic tetrahedral frameworks. II. Polynodal graphs , 2004 .

[3]  J. Gale,et al.  ZeoTsites: a code for topological and crystallographic tetrahedral sites analysis in zeolites and zeotypes , 2001 .

[4]  M. O'Keeffe,et al.  Dense and rare four-connected nets , 1991 .

[5]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[6]  David Olson,et al.  Atlas of Zeolite Framework Types , 2007 .

[7]  Linn W. Hobbs,et al.  Network properties of crystalline polymorphs of silica , 1990 .

[8]  Joseph V. Smith,et al.  Topochemistry of zeolites and related materials. 1. Topology and geometry , 1988 .

[9]  Hans-Joachim Klein,et al.  Properties and efficient algorithmic determination of different classes of rings in finite and infinite polyhedral networks , 1991 .

[10]  G. Brunner.  Criteria for the evaluation of hypothetical zeolite frameworks , 1990 .

[11]  J. Smith,et al.  Enumeration of 4-connected 3-dimensional nets and classification of framework silicates, II, Perpendicular and near-perpendicular linkages from 4.8 2 ,3.12 2 and 4.6.12 nets , 1978 .

[12]  Michael O'Keeffe,et al.  Identification of and symmetry computation for crystal nets. , 2003, Acta crystallographica. Section A, Foundations of crystallography.

[13]  Bonnie Berger,et al.  Local topology of silica networks , 1998 .

[14]  A. F. Wells.  Three-dimensional nets and polyhedra , 1977 .

[15]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[16]  G. Brunner.  The properties of coordination sequences and conclusions regarding the lowest possible density of zeolites , 1979 .

[17]  E. Koch,et al.  Crystal structures. I. Patterns and symmetry , 1997 .

[18]  B. Quentrec,et al.  New method for searching for neighbors in molecular dynamics computations , 1973 .

[19]  Michael O'Keeffe,et al.  Vertex symbols for zeolite nets , 1997 .