Search Results for ""

A circle is the set of points in a plane that are equidistant from a given point O. The distance r from the center is called the radius, and the point O is called the center. ...

The Moses-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-a, c+a-b, and ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...

The midcircle of two given circles is the circle which would invert the circles into each other. Dixon (1991) gives constructions for the midcircle for four of the five ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

The Kakeya needle problems asks for the plane figure of least area in which a line segment of width 1 can be freely rotated (where translation of the segment is also ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

When referring to a planar object, "free" means that the object is regarded as capable of being picked up out of the plane and flipped over. As a result, mirror images are ...