Search Results for ""

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...

The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...

Consider an infinite repository containing balls of n different types. Then the following table summarizes the number of distinct ways in which k balls can be picked for four ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...

The Feller-Tornier constant is the density of integers that have an even number of prime factors p_i^(a_i) with a_1>1 in their prime factorization. It is given by ...

Because the Legendre polynomials form a complete orthogonal system over the interval [-1,1] with respect to the weighting function w(x)=1, any function f(x) may be expanded ...

Jacobi-Gauss quadrature, also called Jacobi quadrature or Mehler quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function ...

The mean deviation (also called the mean absolute deviation) is the mean of the absolute deviations of a set of data about the data's mean. For a sample size N, the mean ...

A function f(x) is said to be periodic (or, when emphasizing the presence of a single period instead of multiple periods, singly periodic) with period p if f(x)=f(x+np) for ...