Search Results for ""

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

A number of attractive 10-compounds of the regular icosahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 11-compounds of the regular icosahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 2-compounds of the regular icosahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 5-compounds of the regular icosahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 6-compounds of the regular icosahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

Two sets A and B are said to be independent if their intersection A intersection B=emptyset, where emptyset is the empty set. For example, {A,B,C} and {D,E} are independent, ...

The intensity measure mu of a point process X relative to a Borel set B subset R^d is defined to be the expected number of points of X falling in B. Symbolically, ...

The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...

The Ishango bone is the oldest known object containing logical carvings. It was discovered in the Congo, and has been dated to be 22000 years old. The middle column of marks ...