Search Results for ""

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

A two-dimensional binary (k=2) totalistic cellular automaton with a von Neumann neighborhood of range r=1. It has a birth rule that at least 2 of its 4 neighbors are alive, ...

A hexagon tiling is a tiling of the plane by identical hexagons. The regular hexagon forms a regular tessellation, also called a hexagonal grid, illustrated above. There are ...

The regular tessellation {6,3} consisting of regular hexagons (i.e., a hexagonal grid). In general, the term honeycomb is used to refer to a tessellation in n dimensions for ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

An Aztec diamond of order n is the region obtained from four staircase shapes of height n by gluing them together along the straight edges. It can therefore be defined as the ...

A square-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...