1984
DOI: 10.1107/s0108767384000088
|View full text |Cite
|
Sign up to set email alerts
|

Nomenclature and generation of three-periodic nets: the vector method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
90
0
1

Year Published

2000
2000
2013
2013

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 137 publications
(92 citation statements)
references
References 6 publications
1
90
0
1
Order By: Relevance
“…As a consequence, different non-isomorphic graphs may have the same quotient graph (Klee, 1987). A system of labels can however be assigned to the edges in such a way that it uniquely determines the infinite structure up to isomorphism via the so-called vector method (Chung et al, 1984). This opens the possibility of an algebraic representation of the quotient graph, which makes it possible to translate the process of comparing crystal structures into a symbolic computer language.…”
Section: Topology Of Crystal Structuresmentioning
confidence: 99%
“…As a consequence, different non-isomorphic graphs may have the same quotient graph (Klee, 1987). A system of labels can however be assigned to the edges in such a way that it uniquely determines the infinite structure up to isomorphism via the so-called vector method (Chung et al, 1984). This opens the possibility of an algebraic representation of the quotient graph, which makes it possible to translate the process of comparing crystal structures into a symbolic computer language.…”
Section: Topology Of Crystal Structuresmentioning
confidence: 99%
“…It is convenient to distinguish between abstract nets and their Euclidean embeddings (Chung et al, 1984). Specifically the vertices and edges of the graph correspond in this paper to nodes and kinks in an embedding.…”
Section: Minimal Nets and Their Embeddingsmentioning
confidence: 99%
“…Minimal nets are those that have the minimal number of vertices and edges in their repeat units. More specifically, their quotient graphs (Chung et al, 1984) have cyclomatic number, g, equal to d where d is the periodicity of the net. In this paper we are concerned exclusively with 3-periodic structures, so d = 3.…”
Section: Introductionmentioning
confidence: 99%
“…However, within the framework of this model, the immediate analysis of only local topology is possible. For the study of the global topological properties and also for the machine representation of an in®nite graph, it is convenient to use the method of reducing it to a ®nite`reduced' graph (RG) or so-called labeled quotient graph, as was suggested by Chung et al (1984). The operation of reducing can be visually represented by closing the edges of an in®nite graph, which are extended outside or are on the boundary of a unit cell, to translationally identical vertices, being inside the unit cell or on its boundary (Fig.…”
Section: Introductionmentioning
confidence: 99%
“…Hereinafter, we use the term subnet' to pay attention to a system of interatomic bonds and the term`sublattice' to emphasize that the topological properties are insigni®cant in such a context. According to Chung et al (1984), it is necessary to mark properly the RG vertices, which are incident to loops and multiple edges to store the information on the topology of these subnets. For this purpose, let us select in each subnet an origin atom being inside a given unit cell and assign to it the code (0, 0, 0).…”
Section: Introductionmentioning
confidence: 99%