Search Results for ""

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

The necker cube is an illusion in which a two-dimensional drawing of an array of cubes appears to simultaneously protrude from and intrude into the page. A Necker cube ...

In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...

The tangential triangle is the triangle DeltaT_AT_BT_C formed by the lines tangent to the circumcircle of a given triangle DeltaABC at its vertices. It is therefore antipedal ...

Given three jugs with x pints in the first, y in the second, and z in the third, obtain a desired amount in one of the vessels by completely filling up and/or emptying ...

An n-trapezohedron, also called an antidipyramid, antibipyramid, or deltohedron (not to be confused with a deltahedron), is a solid composed of interleaved symmetric ...

The Thue-Morse sequence, also called the Morse-Thue sequence or Prouhet-Thue-Morse sequence (Allouche and Cosnard 2000), is one of a number of related sequences of numbers ...

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

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

The nth central trinomial coefficient is defined as the coefficient of x^n in the expansion of (1+x+x^2)^n. It is therefore the middle column of the trinomial triangle, i.e., ...