Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

From symmetry-labeled quotient graphs of crystal nets to coordination sequences

Algebraic tools for a combinatorial analysis of crystal structures

  • Original Research
  • Published:
Structural Chemistry Aims and scope Submit manuscript

Abstract

The combinatorial topology of crystal structures may be described by finite graphs, called symmetry-labeled quotient graphs or voltage graphs, with edges labeled by symmetry operations from their space group. These symmetry operations themselves generate a space group which is generally a non-trivial subgroup of the crystal space group. The method is an extension of the so-called vector method, where translation symmetries are used as vector labels (voltages) for the edges of the graph. Non-translational symmetry operations may be used as voltages if they act freely on the net underlying the crystal structure. This extension provides a significant reduction of the size of the quotient graph. A few uninodal and binodal nets are examined as illustrations. In particular, various uninodal nets appear to be isomorphic to Cayley color graphs of space group. As an application, the full coordination sequence of the diamond net is determined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Delgado-Friedrichs O, Foster MD, O’Keeffe M, Proserpio DM, Treacy MMJ, Yaghi OM (2005) What do we know about three-periodic nets? J Solid State Chem 178:2533–2554

    Article  CAS  Google Scholar 

  2. Chung SJ, Hahn Th, Klee WE (1984) Nomenclature and generation of 3-periodic nets—the vector method. Acta Cryst A40:42–50

    CAS  Google Scholar 

  3. Delgado-Friedrichs O, O’Keeffe M (2003) Identification and symmetry computation for crystal nets. Acta Cryst A59:351–360

    CAS  Google Scholar 

  4. Eon J-G (2004) Topological density of nets: a direct calculation. Acta Cryst A60:7–18

    CAS  Google Scholar 

  5. Blatov VA (2006) Multipurpose crystallochemical analysis with the program package TOPOS. IUCr CompComm Newsl 7:4–38

    Google Scholar 

  6. Klein H-J (1996) Systematic generation of models for crystal structures. Math Model Sci Comput 6:325–330

    Google Scholar 

  7. Koch E, Fischer W (1995) Sphere packings with three contacts per sphere and the problem of the least dense sphere packing. Z Kristallogr 210:407–414

    Article  CAS  Google Scholar 

  8. Treacy MMJ, Randall KH, Rao S, Perry JA, Chadi DJ (1997) Enumeration of periodic tetrahedral frameworks. Z Kristallogr 212:768–791

    Article  CAS  Google Scholar 

  9. Eon J-G (2002) Algebraic determination of generating functions for coordination sequences in crystal structures. Acta Cryst A58:47–53

    CAS  Google Scholar 

  10. Klee WE (2004) Crystallographic nets and their quotient graphs. Cryst Res Technol 39:959–968

    Article  CAS  Google Scholar 

  11. Gross JL, Tucker ThW (2000) Topological graph theory. Dover, Mineola

    Google Scholar 

  12. Eon J-G (2011) Euclidian embeddings of periodic nets: definition of a topologically induced, complete set of geometric descriptors for crystal structures. Acta Cryst A67:68–86

    CAS  Google Scholar 

  13. OKeeffe M, Peskov MA, Ramsden SJ, Yaghi OM (2008) The Reticular Chemistry Structure Resource (RCSR) database of, and symbols for, crystal nets. Acc Chem Res 41:1782–1789

    Article  CAS  Google Scholar 

  14. Eon J-G (2007) Infinite geodesic paths and fibers, new topological invariants in periodic graphs. Acta Cryst A63:53–65

    CAS  Google Scholar 

Download references

Acknowledgments

The author thanks CNPq (Conselho Nacional de Desenvolvimento e Pesquisa) of Brazil for support during the preparation of this study.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean-Guillaume Eon.

Appendix

Appendix

We say that a triangular face of the cycle-figure is of type (p, q, r) if its vertices correspond to cycles of the quotient graph of lengths p, q and r. The topological density of a three-periodic net is given [4] after triangulation of the cycle-figure by

$$ \rho = Z\sum\limits_{\sigma } {(p.q.r)}^{ - 1} /6 $$

where Z is the order (number of vertices) of the quotient graph and the summation is over the triangular faces σ of the cycle-figure.

Every cycle in the quotient graph of dia has length 2 and, after triangulation, there are 20 faces in the cycle-figure, hence

$$ \rho \left( {{\mathbf{dia}}} \right) \, = { 2}\left[ { 20.\left( { 2. 2. 2} \right)^{ - 1} } \right]/ 6 { } = { 5}/ 6. $$

After triangulation, the cycle-figure of ths contains 8 faces of type (2,2,4), 8 faces of type (2,4,4) and 4 faces of type (4,4,4), hence

$$ \rho \left( {{\mathbf{ths}}} \right) \, = { 4}\left[ { 8.\left( { 2. 2. 4} \right)^{ - 1} + 8.\left( { 2. 4. 4} \right)^{ - 1} + 4.\left( { 4. 4. 4} \right)^{ - 1} } \right]/ 6= 1 3/ 2 4. $$

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eon, JG. From symmetry-labeled quotient graphs of crystal nets to coordination sequences. Struct Chem 23, 987–996 (2012). https://doi.org/10.1007/s11224-012-0006-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11224-012-0006-2

Keywords