An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In crystallography, a periodic graph or crystal net is a three-dimensional periodic graph, i.e., a three-dimensional Euclidean graph whose vertices or nodes are points in three-dimensional Euclidean space, and whose edges (or bonds or spacers) are line segments connecting pairs of vertices, periodic in three linearly independent axial directions. There is usually an implicit assumption that the set of vertices are uniformly discrete, i.e., that there is a fixed minimum distance between any two vertices. The vertices may represent positions of atoms or complexes or clusters of atoms such as single-metal ions, molecular building blocks, or secondary building units, while each edge represents a chemical bond or a polymeric ligand.

Property Value
dbo:abstract
  • In crystallography, a periodic graph or crystal net is a three-dimensional periodic graph, i.e., a three-dimensional Euclidean graph whose vertices or nodes are points in three-dimensional Euclidean space, and whose edges (or bonds or spacers) are line segments connecting pairs of vertices, periodic in three linearly independent axial directions. There is usually an implicit assumption that the set of vertices are uniformly discrete, i.e., that there is a fixed minimum distance between any two vertices. The vertices may represent positions of atoms or complexes or clusters of atoms such as single-metal ions, molecular building blocks, or secondary building units, while each edge represents a chemical bond or a polymeric ligand. Although the notion of a periodic graph or crystal net is ultimately mathematical (actually a crystal net is nothing but a periodic realization of an abelian covering graph over a finite graph), and is closely related to that of a Tessellation of space (or honeycomb) in the theory of polytopes and similar areas, much of the contemporary effort in the area is motivated by crystal engineering and prediction (design), including metal-organic frameworks (MOFs) and zeolites. (en)
  • 拓扑结构或拓扑网是晶体学上的一个概念,它是将晶体中的节点以拓扑形式的简化。它在沸石材料、金属有机框架材料等领域有着重要应用。 不同类别的拓扑结构有不同的符号表示,如钻石结构用dia表示,面心立方结构用fcu表示。完整的表格可以在PCSR数据库中查看。 (zh)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 29008381 (xsd:integer)
dbo:wikiPageLength
  • 22489 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1082301819 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 拓扑结构或拓扑网是晶体学上的一个概念,它是将晶体中的节点以拓扑形式的简化。它在沸石材料、金属有机框架材料等领域有着重要应用。 不同类别的拓扑结构有不同的符号表示,如钻石结构用dia表示,面心立方结构用fcu表示。完整的表格可以在PCSR数据库中查看。 (zh)
  • In crystallography, a periodic graph or crystal net is a three-dimensional periodic graph, i.e., a three-dimensional Euclidean graph whose vertices or nodes are points in three-dimensional Euclidean space, and whose edges (or bonds or spacers) are line segments connecting pairs of vertices, periodic in three linearly independent axial directions. There is usually an implicit assumption that the set of vertices are uniformly discrete, i.e., that there is a fixed minimum distance between any two vertices. The vertices may represent positions of atoms or complexes or clusters of atoms such as single-metal ions, molecular building blocks, or secondary building units, while each edge represents a chemical bond or a polymeric ligand. (en)
rdfs:label
  • شبكة بلورية (ar)
  • Periodic graph (crystallography) (en)
  • 晶体拓扑结构 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License