Search Results for ""

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

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 ...

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

A transformation in which vectors are transformed in a fixed coordinate system. In contrast, a transformation in which the coordinate system is changed, leaving vectors in ...

An anyon is a projective representation of a Lie group.

A general reciprocity theorem for all orders which covered all other known reciprocity theorems when proved by E. Artin in 1927. If R is a number field and R^' a finite ...

The augmented dodecahedron is Johnson solid J_(58), which is formed from augmentation of one of the faces of the regular dodecahedron by an equilateral pentagonal pyramid. It ...

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

A two-dimensional map which is conjugate to the Hénon map in its nondissipative limit. It is given by x^' = x+y^' (1) y^' = y+epsilony+kx(x-1)+muxy. (2)