the Laves graph is an infinite and highly symmetric system of points and line segments in three-dimensional Euclidean space, forming a periodic graph. Three...
23 KB (2,807 words) - 00:39, 20 June 2025
Australian Aboriginal languages. Laves phase, a particular class of intermetallic phases Laves graph, a periodic spatial graph Laves tiling, dual of an Archimedean...
748 bytes (126 words) - 14:52, 6 March 2024
Society from 1956 to 1958. He is the namesake of Laves phases and the Laves tilings; the Laves graph, a highly-symmetrical three-dimensional crystal structure...
9 KB (847 words) - 05:56, 14 March 2025
generated by the hexagonal close-packing The 17-sided Voronoi cells of the Laves graph Many other plesiohedra are known. Two different ones with the largest...
11 KB (1,293 words) - 19:12, 6 December 2022
Diamond cubic (category Infinite graphs)
ordered y-edge. Another (hypothetical) crystal with this property is the Laves graph (also called the K4 crystal, (10,3)-a, or the diamond twin). The compressive...
12 KB (1,491 words) - 06:09, 6 November 2024
pentadecagonal prism. The infinite Laves graph has convex heptadecahedral Voronoi cells. Because of the symmetries of the graph, these heptadecahedra are plesiohedra...
3 KB (253 words) - 04:44, 21 March 2025
z\cos x=0} The gyroid structure is closely related to the K4 crystal (Laves' graph of girth ten). In nature, self-assembled gyroid structures are found...
16 KB (1,752 words) - 17:36, 9 June 2025
pentagons, hexagons, and heptagons which can either be flat or tubular. The Laves graph or K4 crystal is a theoretically predicted three-dimensional crystalline...
48 KB (5,762 words) - 20:24, 23 June 2025
Coordination sequence (category Infinite graphs)
In crystallography and the theory of infinite vertex-transitive graphs, the coordination sequence of a vertex v {\displaystyle v} is an integer sequence...
5 KB (515 words) - 14:04, 3 March 2024
as diaphragm Planar separator theorem, a theorem in graph theory Vertex separator, a notion in graph theory Geometric separator, a line that separates a...
2 KB (272 words) - 22:21, 17 September 2023
Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs. An incomparability...
13 KB (1,398 words) - 07:00, 10 May 2025
Hasse diagram (redirect from Cover graph)
automatically using graph drawing techniques. In some sources, the phrase "Hasse diagram" has a different meaning: the directed acyclic graph obtained from...
11 KB (1,342 words) - 10:38, 16 December 2024
Laval—Les Îles (French pronunciation: [laval lez‿il]) is a federal electoral district in Quebec, Canada, that has been represented in the House of Commons...
13 KB (364 words) - 19:31, 1 May 2025
data in the table and graph below refer to the commune of Laval proper, in its geography at the given years. The commune of Laval absorbed the former communes...
43 KB (5,180 words) - 09:46, 8 January 2025
disdyakis triacontahedron Simplicial tilings: Regular: triangular tiling Laves tilings: tetrakis square tiling, triakis triangular tiling, kisrhombille...
2 KB (183 words) - 06:44, 27 August 2024
Preorder (section Graph theory)
graph. A preorder that is symmetric is an equivalence relation; it can be thought of as having lost the direction markers on the edges of the graph....
23 KB (3,383 words) - 03:35, 23 April 2025
Contour line (redirect from Contour graph)
joins points of equal value. It is a plane section of the three-dimensional graph of the function f ( x , y ) {\displaystyle f(x,y)} parallel to the ( x ...
38 KB (4,492 words) - 01:06, 20 June 2025
Transitive closure (category Graph algorithms)
closure and transitive reduction are also used in the closely related area of graph theory. A relation R on a set X is transitive if, for all x, y, z in X,...
17 KB (2,306 words) - 08:24, 25 February 2025
Alfred-Pellan (redirect from Laval East)
Alfred-Pellan (formerly Duvernay and Laval East) is a federal electoral district in Quebec, Canada, that has been represented in the House of Commons...
18 KB (453 words) - 01:45, 25 May 2025
census. As can be seen by the graph, the majority of people, 44 people, are aged between 45 and 54. 22% percent of Magdalen Laver residents are 65 or over...
9 KB (810 words) - 23:31, 8 February 2025
lattice. As the dual to a uniform tiling, it is one of eleven possible Laves tilings, and in the face configuration for monohedral tilings it is denoted...
15 KB (1,577 words) - 10:42, 21 February 2025
Dilworth's theorem (category Perfect graphs)
comparability graph is itself a comparability graph, formed from the restriction of the partial order to a subset of its elements. An undirected graph is perfect...
18 KB (2,445 words) - 18:06, 31 December 2024
Voronoi diagram (redirect from Voronoi graph)
metrics. Voronoi diagrams of 20 points under two different metrics The dual graph for a Voronoi diagram (in the case of a Euclidean space with point sites)...
46 KB (5,504 words) - 02:43, 25 March 2025
The graph of a monotone operator G ( T ) {\displaystyle G(T)} is a monotone set. A monotone operator is said to be maximal monotone if its graph is a...
19 KB (2,471 words) - 01:32, 25 January 2025
Laver's theorem, in order theory, states that order embeddability of countable total orders is a well-quasi-ordering. That is, for every infinite sequence...
3 KB (313 words) - 20:34, 15 December 2022
Causal set, a poset-based approach to quantum gravity Comparability graph – Graph linking pairs of comparable elements in a partial order Complete partial...
40 KB (5,418 words) - 19:44, 28 May 2025
Saint-Genis-Laval (French pronunciation: [sɛ̃ ʒəni laval]) is a commune in the metropolis of Lyon in the Auvergne-Rhône-Alpes region of eastern France...
5 KB (538 words) - 08:57, 6 June 2025
vertex or vertices per polygon. These patterns include snowflake, Penrose, Laves and Altair tilings. These add complexity by varying the number of possible...
18 KB (2,623 words) - 13:24, 12 August 2024
the sense of graph theory in one of two ways: either as a tree (graph theory) or as a trivially perfect graph. In the first case, the graph is the undirected...
12 KB (1,558 words) - 03:18, 22 June 2025
Mirsky's theorem (category Perfect graphs)
complement graph of a comparability graph is perfect. The perfect graph theorem of Lovász (1972) states that the complements of perfect graphs are always...
8 KB (1,119 words) - 13:33, 10 November 2023