Search Results for ""

The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...

"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 ...

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

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 ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...