Search Results for ""

Let there be m doctors and n<=m patients, and let all mn possible combinations of examinations of patients by doctors take place. Then what is the minimum number of surgical ...

A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

The Gregory series is a pi formula found by Gregory and Leibniz and obtained by plugging x=1 into the Leibniz series, pi/4=sum_(k=1)^infty((-1)^(k+1))/(2k-1)=1-1/3+1/5-... ...

The Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...

Like the entire harmonic series, the harmonic series sum_(k=1)^infty1/(p_k)=infty (1) taken over all primes p_k also diverges, as first shown by Euler in 1737 (Nagell 1951, ...

The Hartley Transform is an integral transform which shares some features with the Fourier transform, but which, in the most common convention, multiplies the integral kernel ...

In cylindrical coordinates, the scale factors are h_r=1, h_theta=r, h_z=1, so the Laplacian is given by del ...