Search Results for ""

The central point in a wheel graph W_n. The hub has degree n-1.

A function which has infinitely many derivatives at a point. If a function is not polygenic, it is monogenic.

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

A special nonsingular map from one manifold to another such that at every point in the domain of the map, the derivative is an injective linear transformation. This is ...

The outer Vecten circle is the circumcircle of the outer Vecten triangle. It has center at Kimberling center X_(641), which is the complement of the outer Vecten point ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

The curve given by the polar equation r=a(1-costheta), (1) sometimes also written r=2b(1-costheta), (2) where b=a/2. The cardioid has Cartesian equation ...

The Longuet-Higgins circle is the radical circle of the circles centered at the vertices A, B, and C of a reference triangle with respective radii b+c, c+a, and a+b. Its ...

Given a triangle DeltaABC, construct the contact triangle DeltaDEF. Then the Nobbs points are the intersections of the corresponding sides of triangles DeltaABC and DeltaDEF, ...

The Tutte 8-cage (Godsil and Royle 2001, p. 59; right figure) is a cubic graph on 30 nodes and 45 edges which is the Levi graph of the Cremona-Richmond configuration. It ...