Search Results for ""

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...

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 nth central trinomial coefficient is defined as the coefficient of x^n in the expansion of (1+x+x^2)^n. It is therefore the middle column of the trinomial triangle, i.e., ...

The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...

The confocal ellipsoidal coordinates, called simply "ellipsoidal coordinates" by Morse and Feshbach (1953) and "elliptic coordinates" by Hilbert and Cohn-Vossen (1999, p. ...

The correlation coefficient, sometimes also called the cross-correlation coefficient, Pearson correlation coefficient (PCC), Pearson's r, the Perason product-moment ...

A Cunningham number is a binomial number of the form C^+/-(b,n)=b^n+/-1 with b>1 and n positive integers. Bases b^k which are themselves powers need not be considered since ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...