Movatterモバイル変換


[0]ホーム

URL:


About:Coordination sequence

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

In crystallography and the theory of infinite vertex-transitive graphs, the coordination sequence of a vertex is an integer sequence that counts how many vertices are at each possible distance from . That is, it is a sequence As an example, in a square grid, for each positive integer , there are grid points that are steps away from the origin. Therefore, the coordination sequence of the square grid is the sequence in which, except for the initial value of one, each number is a multiple of four.

thumbnail
PropertyValue
dbo:abstract
  • In crystallography and the theory of infinite vertex-transitive graphs, the coordination sequence of a vertex is an integer sequence that counts how many vertices are at each possible distance from . That is, it is a sequence where each is the number of vertices that are steps away from . If the graph is vertex-transitive, then the sequence is an invariant of the graph that does not depend on the specific choice of . Coordination sequences can also be defined for sphere packings, by using either the contact graph of the spheres or the Delaunay triangulation of their centers, but these two choices may give rise to different sequences. As an example, in a square grid, for each positive integer , there are grid points that are steps away from the origin. Therefore, the coordination sequence of the square grid is the sequence in which, except for the initial value of one, each number is a multiple of four. The concept was proposed by Georg O. Brunner and Fritz Laves and later developed by Michael O'Keefe. The coordination sequences of many low-dimensional lattices and uniform tilings are known. (en)
dbo:thumbnail
dbo:wikiPageID
  • 67980941 (xsd:integer)
dbo:wikiPageLength
  • 3652 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1124256662 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In crystallography and the theory of infinite vertex-transitive graphs, the coordination sequence of a vertex is an integer sequence that counts how many vertices are at each possible distance from . That is, it is a sequence As an example, in a square grid, for each positive integer , there are grid points that are steps away from the origin. Therefore, the coordination sequence of the square grid is the sequence in which, except for the initial value of one, each number is a multiple of four. (en)
rdfs:label
  • Coordination sequence (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
isdbo:knownFor of
isdbo:wikiPageWikiLink of
isdbp:knownFor of
isfoaf: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 fromWikipedia and is licensed under theCreative Commons Attribution-ShareAlike 3.0 Unported License

[8]ページ先頭

©2009-2025 Movatter.jp