Search Results for ""

A periodic continued fraction is a continued fraction (generally a regular continued fraction) whose terms eventually repeat from some point onwards. The minimal number of ...

The ideal generated by a set in a vector space.

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

Given any triangle ABC, the signed sum of perpendicular distances from the circumcenter O to the sides (i.e., signed lengths of the pedal lines from O) is OO_A+OO_B+OO_C=R+r, ...

A curve investigated by Talbot which is the ellipse negative pedal curve with respect to the ellipse's center for ellipses with eccentricity e^2>1/2 (Lockwood 1967, p. 157). ...

A curve named after James Watt (1736-1819), the Scottish engineer who developed the steam engine (MacTutor Archive). The curve is produced by a linkage of rods connecting two ...

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

The outer Napoleon triangle is the triangle DeltaN_C^'N_B^'N_A^' formed by the centers of externally erected equilateral triangles DeltaABE_C^', DeltaACE_B^', and ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...