Abstract
A crystal net can be derived from a `generalized' voltage graph representing a graph analog of a fundamental domain of that crystal net along with a sufficient collection of its symmetries. The voltage assignments include not only isometries to the (oriented) edges, but also `weight' groups assigned to vertices for generating the vertex figures around those vertices. By varying the voltage assignments, one obtains geometrically distinct – and occasionally topologically distinct – Euclidean graphs. The focus here is on deriving simple graphs, i.e. graphs with no loops or lunes, especially uninodal edge transitive graphs.
Publisher
International Union of Crystallography (IUCr)
Subject
Inorganic Chemistry,Physical and Theoretical Chemistry,Condensed Matter Physics,General Materials Science,Biochemistry,Structural Biology
Reference40 articles.
1. Abelson, H. & deSessa, A. A. (1980). Turtle Geometry: The Computer as a Medium for Exploring Mathematics. Cambridge, Massachusetts, USA: MIT Press.
2. Bilbao Crystallographic Server. II. Representations of crystallographic point groups and space groups
3. Bilbao Crystallographic Server: I. Databases and crystallographic computing programs
4. Behzad, M., Chartrand, G. & Lesniak-Foster, (1979). Graphs and Digraphs. Boston, Massachusetts, USA: Prindle, Weber and Schmidt.