Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7168638> ?p ?o }
Showing triples 1 to 49 of
49
with 100 triples per page.
- Q7168638 subject Q7007195.
- Q7168638 abstract "A Euclidean graph (a graph embedded in some Euclidean space) is periodic if there exists a basis of that Euclidean space whose corresponding translations induce symmetries of that graph (i.e., application of any such translation to the graph embedded in the Euclidean space leaves the graph unchanged). Equivalently, a periodic Euclidean graph is a periodic realization of an abelian covering graph over a finite graph. A Euclidean graph is uniformly discrete if there is a minimal distance between any two vertices. Periodic graphs are closely related to tessellations of space (or honeycombs) and the geometry of their symmetry groups, hence to geometric group theory, as well as to discrete geometry and the theory of polytopes, and similar areas.Much of the effort in periodic graphs is motivated by applications to natural science and engineering, particularly of three-dimensional crystal nets to crystal engineering, crystal prediction (design), and modeling crystal behavior. Periodic graphs have also been studied in modeling very-large-scale integration (VLSI) circuits.".
- Q7168638 wikiPageExternalLink home.html.
- Q7168638 wikiPageWikiLink Q11059889.
- Q7168638 wikiPageWikiLink Q11469.
- Q7168638 wikiPageWikiLink Q1189295.
- Q7168638 wikiPageWikiLink Q1347011.
- Q7168638 wikiPageWikiLink Q1474108.
- Q7168638 wikiPageWikiLink Q1503271.
- Q7168638 wikiPageWikiLink Q1545397.
- Q7168638 wikiPageWikiLink Q166154.
- Q7168638 wikiPageWikiLink Q17295.
- Q7168638 wikiPageWikiLink Q175116.
- Q7168638 wikiPageWikiLink Q181332.
- Q7168638 wikiPageWikiLink Q189061.
- Q7168638 wikiPageWikiLink Q189569.
- Q7168638 wikiPageWikiLink Q209306.
- Q7168638 wikiPageWikiLink Q2103034.
- Q7168638 wikiPageWikiLink Q211459.
- Q7168638 wikiPageWikiLink Q2393193.
- Q7168638 wikiPageWikiLink Q245595.
- Q7168638 wikiPageWikiLink Q253829.
- Q7168638 wikiPageWikiLink Q263214.
- Q7168638 wikiPageWikiLink Q2662474.
- Q7168638 wikiPageWikiLink Q34929.
- Q7168638 wikiPageWikiLink Q36161.
- Q7168638 wikiPageWikiLink Q383444.
- Q7168638 wikiPageWikiLink Q5154570.
- Q7168638 wikiPageWikiLink Q5191408.
- Q7168638 wikiPageWikiLink Q5191417.
- Q7168638 wikiPageWikiLink Q5450441.
- Q7168638 wikiPageWikiLink Q5625489.
- Q7168638 wikiPageWikiLink Q61748.
- Q7168638 wikiPageWikiLink Q65202.
- Q7168638 wikiPageWikiLink Q7007195.
- Q7168638 wikiPageWikiLink Q7168637.
- Q7168638 wikiPageWikiLink Q726827.
- Q7168638 wikiPageWikiLink Q7433187.
- Q7168638 wikiPageWikiLink Q746083.
- Q7168638 wikiPageWikiLink Q747980.
- Q7168638 wikiPageWikiLink Q7843643.
- Q7168638 wikiPageWikiLink Q876049.
- Q7168638 wikiPageWikiLink Q893737.
- Q7168638 wikiPageWikiLink Q899033.
- Q7168638 wikiPageWikiLink Q902019.
- Q7168638 wikiPageWikiLink Q902950.
- Q7168638 wikiPageWikiLink Q906377.
- Q7168638 comment "A Euclidean graph (a graph embedded in some Euclidean space) is periodic if there exists a basis of that Euclidean space whose corresponding translations induce symmetries of that graph (i.e., application of any such translation to the graph embedded in the Euclidean space leaves the graph unchanged). Equivalently, a periodic Euclidean graph is a periodic realization of an abelian covering graph over a finite graph.".
- Q7168638 label "Periodic graph (geometry)".