Realizations of crystal nets. I. (Generalized) derived graphs

Area of Science:

• Crystallography
• Graph Theory
• Computational Geometry

Background:

• Crystal nets are fundamental to understanding crystal structures.
• Generalized voltage graphs offer a novel framework for representing geometric and symmetry information.
• Existing methods may not fully capture the complexity of crystal net generation.

Purpose of the Study:

• To develop a method for deriving crystal nets from generalized voltage graphs.
• To explore the generation of distinct Euclidean graphs through varied voltage assignments.
• To focus on deriving simple, uninodal edge transitive graphs.

Main Methods:

• Representing crystal nets as generalized voltage graphs.
• Incorporating isometries and weight groups as voltage assignments.
• Analyzing graph properties, including simplicity and edge transitivity.

Main Results:

• Successful derivation of crystal nets from voltage graph analogs.
• Demonstration of generating geometrically and topologically distinct Euclidean graphs.
• Identification of specific graph types, such as uninodal edge transitive graphs.

Conclusions:

• Generalized voltage graphs provide a powerful tool for crystal net derivation.
• The method allows for systematic exploration of graph variations.
• This approach facilitates the study of specific graph classes relevant to crystallography.