Search Results for ""
691 - 700 of 2283 for Triangular Grid GraphSearch Results
Turmites, also called turning machines, are 2-dimensional Turing machines in which the "tape" consists of a grid of spaces that can be written and erased by an active ...
The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...
Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...
The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...
A pentahedron is polyhedron having five faces. Because there are two pentahedral graphs, there are two convex pentahedra, corresponding to the topologies of the square ...
A polyhedron with extra triangular faces, given by the Schläfli symbol s{p; q}.
A distinct (including reflections and rotations) arrangement of adjacent squares on a grid, also called a fixed polyomino.
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 ...
The illusion in view by staring at the small black dot for a half minute or so, then switching to the white dot. The black squares appear stationary when staring at the white ...
A plot of the cells on a grid satisfying bitwise XOR(a,b)<n for consecutive values of n=1, 2, .... It is thought that it was discovered by Jackson Wright on the RLE PDP-1 ...
...
View search results from all Wolfram sites (17976 matches)

