Search Results for ""
1641 - 1650 of 2264 for Vertex transitive graphSearch Results
"Chaos" is a tricky thing to define. In fact, it is much easier to list properties that a system described as "chaotic" has rather than to give a precise definition of chaos. ...
Given a triangle DeltaABC, the triangle DeltaH_AH_BH_C whose vertices are endpoints of the altitudes from each of the vertices of DeltaABC is called the orthic triangle, or ...
The pedal of a curve C with respect to a point O is the locus of the foot of the perpendicular from O to the tangent to the curve. More precisely, given a curve C, the pedal ...
The Reuleaux tetrahedron, sometimes also called the spherical tetrahedron, is the three-dimensional solid common to four spheres of equal radius placed so that the center of ...
The point of concurrence K of the symmedians, sometimes also called the Lemoine point (in England and France) or the Grebe point (in Germany). Equivalently, the symmedian ...
A tiling of regular polygons (in two dimensions), polyhedra (three dimensions), or polytopes (n dimensions) is called a tessellation. Tessellations can be specified using a ...
The 57-cell, also called the pentacontaheptachoron, is a regular self-dual locally projective polytope with 57 hemidodecahedral facets described by Coxeter (1982) and also ...
The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...
A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...
The cubitruncated cuboctahedron (called the cubotruncated cuboctahedron by Wenninger 1971, p. 121) is the uniform polyhedron with Maeder index 16 (Maeder 1997), Wenninger ...
...
View search results from all Wolfram sites (14104 matches)

