Search Results for ""

A symbol consisting of three rational numbers that can be used to describe uniform polyhedra based on how a point C in a spherical triangle can be selected so as to trace the ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...

The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...

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

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

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 graph G is hypohamiltonian if G is nonhamiltonian, but G-v is Hamiltonian for every v in V (Bondy and Murty 1976, p. 61). The Petersen graph, which has ten nodes, is the ...