Search Results for ""

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

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

A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...

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