Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO(4))( n−) tetrahedra

Chain, ribbon and tube silicates are based on one-dimensional polymerizations of (TO(4))( n−) tetrahedra, where T = Si(4+) plus P(5+), V(5+), As(5+), Al(3+), Fe(3+) and B(3+). Such polymerizations may be represented by infinite graphs (designated chain graphs) in which vertices represent tetrahedra and edges represent linkages between tetrahedra. The valence-sum rule of bond-valence theory limits the maximum degree of any vertex to 4 and the number of edges linking two vertices to 1 (corner-sharing tetrahedra). The unit cell (or repeat unit) of the chain graph generates the chain graph through action of translational symmetry operators. The (infinite) chain graph is converted into a finite graph by wrapping edges that exit the unit cell such that they link to vertices within the unit cell that are translationally equivalent to the vertices to which they link in the chain graph, and the wrapped graph preserves all topological information of the chain graph. A symbolic algebra is developed that represents the degree of each vertex in the wrapped graph. The wrapped graph is represented by its adjacency matrix which is modified to indicate the direction of wrapped edges, up (+c) or down (−c) along the direction of polymerization. The symbolic algebra is used to generate all possible vertex connectivities for graphs with ≤8 vertices. This method of representing chain graphs by finite matrices may now be inverted to generate all non-isomorphic chain graphs with ≤8 vertices for all possible vertex connectivities. MatLabR2019b code is provided for computationally intensive steps of this method and ∼3000 finite graphs (and associated adjacency matrices) and ∼1500 chain graphs are generated.