Generating Geometric Graphs Using Automorphisms
DOI:
https://doi.org/10.7155/jgaa.00272Abstract
We outline an algorithm for generating nets, a "net" being a geometric graph embedded in a space on which some group acts transitively. We prove that any connected net in such a space can be generated by this process, which can also be regarded as a covering of the net by copies of a connected "transversal" subnet. This paper outlines some of the underlying theory supporting a crystal prediction and design program currently under development. The paper begins with some background in geometric group theory.Downloads
Download data is not yet available.
Downloads
Published
2012-01-01
How to Cite
McColm, G. (2012). Generating Geometric Graphs Using Automorphisms. Journal of Graph Algorithms and Applications, 16(2), 507–541. https://doi.org/10.7155/jgaa.00272
License
Copyright (c) 2012 Gregory McColm
This work is licensed under a Creative Commons Attribution 4.0 International License.