In graph theory, a lattice graph, mesh graph, or grid graph is a graph whose drawing, embedded in some Euclidean space ⁠ R n {\displaystyle \mathbb {R}...

in a vector space over a field Lattice graph, a graph that can be drawn within a repeating arrangement of points Lattice-based cryptography, encryption...

mechanics and mathematics, the Bethe lattice (also called a regular tree) is an infinite connected cycle-free graph where all vertices have the same number...

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges...

neighbours', then they can be connected by an edge, turning the lattice into a lattice graph. The vertices of Λ {\displaystyle \Lambda } are sometimes referred...

constant Lattice-based cryptography Lattice graph Lattice (module) Lattice (order) Mahler's compactness theorem Reciprocal lattice Unimodular lattice "Symmetry...

the face-centered cubic Bravais lattice. The lattice describes the repeat pattern; for diamond cubic crystals this lattice is "decorated" with a motif of...

structures: a preorder on graphs, a distributive lattice, and a category (one for undirected graphs and one for directed graphs). The computational complexity...

ordered sets and discrete distributive lattices, and have an extensive literature". In phylogenetics, the Buneman graph representing all maximum parsimony...

In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

connected graph at what fraction 1 – p of failures the graph will become disconnected (no large component). The same questions can be asked for any lattice dimension...

neighborhood graph in 8n dimensions has a point for each even lattice, and a line joining two points for each odd 8n dimensional lattice with no norm...

mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...

A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered...

In mathematics, the Young–Fibonacci graph and Young–Fibonacci lattice, named after Alfred Young and Leonardo Fibonacci, are two closely related structures...

random packing of equal spheres generally has a density around 63.5%. A lattice arrangement (commonly called a regular arrangement) is one in which the...

independent sets of vertices in path graphs, or via distributive lattices. Like the hypercube graph, the vertices of the Fibonacci cube of order n may be labeled...

Laves graph can be defined by selecting one out of every eight points in the three-dimensional integer lattice, and forming their nearest neighbor graph. Specifically...

which is the complete graph Kq H(2,q), which is the lattice graph Lq,q and also the rook's graph H(d,1), which is the singleton graph K1 H(d,2), which is...

Modular graph, a class of graphs that includes the Hasse diagrams of modular lattices Young–Fibonacci lattice, an infinite modular lattice defined on...

automatically using graph drawing techniques. In some sources, the phrase "Hasse diagram" has a different meaning: the directed acyclic graph obtained from...

Jürgen (2000). "Frankl's conjecture is true for lower semimodular lattices". Graphs and Combinatorics. 16 (1): 115–116. doi:10.1007/s003730050008. S2CID 12660895...

the lattice. Two polytopes are called combinatorially isomorphic if their face lattices are isomorphic. The polytope graph (polytopal graph, graph of the...

join-irreducible elements. If a lattice is distributive, its covering relation forms a median graph. Furthermore, every distributive lattice is also modular. The...

of finite weighted graphs is that by not being restricted to highly regular structures such as discrete regular grids, lattice graphs, or meshes, they can...

Metrication artifacts: When an image is represented by a 4-connected lattice, graph cuts methods can exhibit unwanted "blockiness" artifacts. Various methods...

vertices of the complete graph into the connected components of the subgraph formed by the given set of edges. In this way, the lattice of partitions corresponds...

for H in the set of all graphs with degree distribution identical to that of G. This gives a metric between 0 and 1, where a graph G with small S(G) is "scale-rich"...

{6}}} , the resulting graph is isomorphic to the Higman–Sims graph. Furthermore, the set of all automorphisms of the Leech lattice (that is, Euclidean congruences...