Search Results for ""

The de Longchamps point L is the reflection of the orthocenter H about the circumcenter O of a triangle. It has triangle center function alpha=cosA-cosBcosC, (1) and is ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

The van Aubel line is the line in the plane of a reference triangle that connects the orthocenter H and symmedian point K, and symmedian point of the orthic triangle. The ...

Given an arbitrary planar quadrilateral, place a square outwardly on each side, and connect the centers of opposite squares. Then van Aubel's theorem states that the two ...

von Neumann-Bernays-Gödel set theory (abbreviated "NBG") is a version of set theory which was designed to give the same results as Zermelo-Fraenkel set theory, but in a more ...

An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...

The Feigenbaum constant delta is a universal constant for functions approaching chaos via period doubling. It was discovered by Feigenbaum in 1975 (Feigenbaum 1979) while ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...