Search Results for ""

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

A symmetry of a knot K is a homeomorphism of R^3 which maps K onto itself. More succinctly, a knot symmetry is a homeomorphism of the pair of spaces (R^3,K). Hoste et al. ...

A perfect magic cube is a magic cube for which the rows, columns, pillars, space diagonals, and diagonals of each n×n orthogonal slice sum to the same number (i.e., the magic ...

Let N steps of equal length be taken along a line. Let p be the probability of taking a step to the right, q the probability of taking a step to the left, n_1 the number of ...

The tower of Hanoi (commonly also known as the "towers of Hanoi"), is a puzzle invented by E. Lucas in 1883. It is also known as the Tower of Brahma puzzle and appeared as an ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...

The delta function is a generalized function that can be defined as the limit of a class of delta sequences. The delta function is sometimes called "Dirac's delta function" ...

A special function which is given by the logarithmic derivative of the gamma function (or, depending on the definition, the logarithmic derivative of the factorial). Because ...