Search Results for ""
1451 - 1460 of 2190 for Semi Logarithmic GraphSearch Results
A tree spread in which each node has a finite number of children.
A theory of Hamiltonian cycles.
A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.
The 600-cell is the finite regular four-dimensional polytope with Schläfli symbol {3,3,5}. It is also known as the hypericosahedron or hexacosichoron. It is composed of 600 ...
Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), or equivalently ...
The word polyhedron has slightly different meanings in geometry and algebraic geometry. In geometry, a polyhedron is simply a three-dimensional solid which consists of a ...
A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.
A Ramsey number of the form R(k,k;2).
Edge splitting is the reverse of edge contraction.
An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).
...
View search results from all Wolfram sites (15254 matches)

