Search Results for ""

The truncated dodecahedron is the 32-faced Archimedean solid with faces 20{3}+12{10}. It is also uniform polyhedron with Maeder index 26 (Maeder 1997), Wenninger index 10 ...

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

The truncated tetrahedron is the Archimedean solid with faces 4{3}+4{6}. It is also the uniform polyhedron with Maeder index 2 (Maeder 1997), Wenninger index 6 (Wenninger ...

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

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...

For an integer n>=2, let lpf(n) denote the least prime factor of n. A pair of integers (x,y) is called a twin peak if 1. x<y, 2. lpf(x)=lpf(y), 3. For all z, x<z<y implies ...

A twin Pythagorean triple is a Pythagorean triple (a,b,c) for which two values are consecutive integers. By definition, twin triplets are therefore primitive triples. Of the ...

Two trains are on the same track a distance 100 km apart heading towards one another, each at a speed of 50 km/h. A fly starting out at the front of one train, flies towards ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

Let A={A_1,A_2,...,A_n} be a union-closed set, then the union-closed set conjecture states that an element exists which belongs to at least n/2 of the sets in A. Sarvate and ...