Search Results for ""

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

A conjecture due to M. S. Robertson in 1936 which treats a univalent power series containing only odd powers within the unit disk. This conjecture implies the Bieberbach ...

It is thought that the totient valence function N_phi(m)>=2, i.e., if there is an n such that phi(n)=m, then there are at least two solutions n. This assertion is called ...

Let {A_n}_(n=0)^infty be a sequence of events occurring with a certain probability distribution, and let A be the event consisting of the occurrence of a finite number of ...

The least number of unknotted arcs lying above the plane in any projection. The knot 05-002 has bridge number 2. Such knots are called 2-bridge knots. There is a one-to-one ...

A generalization of Poncelet's continuity principle made by H. Schubert in 1874-1879. The conservation of number principle asserts that the number of solutions of any ...

A number x is said to have "n figures" if it takes n digits to express it. The number of figures is therefore equal to one more than the power of 10 in the scientific ...

A set X whose elements can be numbered through from 1 to n, for some positive integer n. The number n is called the cardinal number of the set, and is often denoted |X| or ...

The term "God's number" is sometimes given to the graph diameter of Rubik's graph, which is the minimum number of turns required to solve a Rubik's cube from an arbitrary ...