Search Results for ""

The de Bruijn constant, also called the Copson-de Bruijn constant, is the minimal constant c=1.1064957714... (OEIS A113276) such that the inequality ...

A k-coloring of a graph G is a vertex coloring that is an assignment of one of k possible colors to each vertex of G (i.e., a vertex coloring) such that no two adjacent ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...

Van der Corput's constant is given by m = 2sqrt(2)int_0^(sqrt(pi/2-c))cos(x^2+c)dx (1) = 2pi[coscC(phi)-sincS(phi)] (2) = 3.3643175781... (3) (OEIS A143305), where C(x) and ...

The set R union {+infty,-infty} obtained by adjoining two improper elements to the set R of real numbers is normally called the set of (affinely) extended real numbers. ...

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

Based on methods developer in collaboration with M. Leclert, Catalan (1865) computed the constant K=0.915965594177... (OEIS A006752) now known as Catalans' constant to 9 ...

The Copeland-Erdős constant has decimal expansion C=0.23571113... (OEIS A033308). The Earls sequence (starting position of n copies of the digit n) for e is given for n=1, 2, ...

The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...