Search Results for ""

There are certain optimization problems that become unmanageable using combinatorial methods as the number of objects becomes large. A typical example is the traveling ...

Skewness is a measure of the degree of asymmetry of a distribution. If the left tail (tail at small end of the distribution) is more pronounced than the right tail (tail at ...

Smale's problems are a list of 18 challenging problems for the twenty-first century proposed by Field medalist Steven Smale. These problems were inspired in part by Hilbert's ...

The small rhombicosidodecahedral graph is a quartic graph on 60 nodes and 120 edges that corresponds to the skeleton of the small rhombicosidodecahedron, as well as the great ...

The (small) rhombicosidodecahedron (Cundy and Rowlett 1989, p. 111), sometimes simply called the rhombicosidodecahedron (Maeder 1997; Wenninger 1989, p. 27; Conway et al. ...

The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, ...

In general, a triakis octahedron is a non-regular icositetrahedron that can be constructed as a positive augmentation of regular octahedron. Such a solid is also known as a ...

The small triambic icosahedron is the dual polyhedron of the small ditrigonal icosidodecahedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. ...

Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...