Related Experiment Video
Updated: Jul 8, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
Symmetric vertex- and edge-transitive 3-periodic nets
Michael O'Keeffe1, Michael M J Treacy2
1School of Molecular Sciences, Arizona State University, Tempe, Arizona 85287, USA.
None:
Vertex- and edge-transitive graphs that admit tilings (tessellate graphs) have been known for 20 years. In this paper, we identify additional families of vertex- and edge-transitive graphs with symmetric embeddings, for which the order of the point symmetry at a vertex equals the vertex's coordination number. Remarkably, symmetric tessellate graphs appear over 150 000 times in crystal structures, while there is only one reported occurrence of a symmetric decussate (untessellable) graph.
More Related Videos
10:44Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
Published on: December 7, 2021
14:52Fabrication of Three-Dimensional Graphene-Based Polyhedrons via Origami-Like Self-Folding
Published on: September 23, 2018
Related Concept Videos
Symmetry
Symmetry Elements in a Crystal
Gauss's Law: Planar Symmetry
Symmetric Member in Bending
Net Change Theorem
Graphs of Trigonometric Functions