Search Results for ""

The m×n king graph is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a king. The number ...

The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

A maze, also known as a labyrinth, as is a set of passages (with impermeable walls). The goal of the maze is to start at one given point and find a path through the passages ...

A group whose group operation is identified with multiplication. As with normal multiplication, the multiplication operation on group elements is either denoted by a raised ...

The Neuberg A_1-circle is the locus of the polygon vertex A_1 of a triangle on a given base A_2A_3 and with a given Brocard angle omega. From the center N_1, the base A_2A_3 ...

Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...

There are a number of attractive polyhedron compounds consisting of five octahedra. The first octahedron 5-compound is a polyhedron compound composed of five octahedra ...

The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...