Search Results for ""

A hexagonal grid is a grid formed by a tessellation of regular hexagons. Boards made of hexagonal grids are often found in strategy and role-playing games because of the lack ...

A hexomino is a 6-polyomino. There are 35 free hexominoes (illustrated above), 60 one-sided hexominoes, and 216 fixed hexominoes.

The sequence defined by H(0)=0 and H(n)=n-H(H(H(n-1))). The first few terms are 1, 1, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 9, 10, 10, 11, 12, 13, 13, 14, ... (OEIS A005374).

The 6-polyiamonds illustrated above.

Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...

The central point in a wheel graph W_n. The hub has degree n-1.

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.

A hyperstring is a simple semi-Hamiltonian acyclic digraph (V,E) with a labeling of the edges in E such that, for all vertices i,j,p,q in V, either pi(i,j)=pi(p,q) or pi(i,j) ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.