Search Results for ""

The snub dodecahedron is an Archimedean solid consisting of 92 faces (80 triangular, 12 pentagonal), 150 edges, and 60 vertices. It is sometimes called the dodecahedron simum ...

Sphere tetrahedron picking is the selection of quadruples of of points corresponding to vertices of a tetrahedron with vertices on the surface of a sphere. n random ...

Stratton (1935), Chu and Stratton (1941), and Rhodes (1970) define the spheroidal functions as those solutions of the differential equation (1) that remain finite at the ...

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

Let the stick number s(K) of a knot K be the least number of straight sticks needed to make a knot K. The smallest stick number of any knot is s(T)=6, where T is the trefoil ...

A sum-free set S is a set for which the intersection of S and the sumset S+S is empty. For example, the sum-free sets of {1,2,3} are emptyset, {1}, {2}, {3}, {1,3}, and ...

A number of attractive tetrahedron 5-compounds can be constructed. The first (left figures) is one of the icosahedron stellations in which the 5×4 vertices of the tetrahedra ...

There are a number of hypotraceable and hypohamiltonian graphs associated with Carsten Thomassen. These graphs, illustrated above, are implemented in the Wolfram Language as ...

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

A leaf of an unrooted tree is a node of vertex degree 1. Note that for a rooted or planted tree, the root vertex is generally not considered a leaf node, whereas all other ...