Search Results for ""

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

For a logarithmic spiral given parametrically as x = ae^(bt)cost (1) y = ae^(bt)sint, (2) evolute is given by x_e = -abe^(bt)sint (3) y_e = abe^(bt)cost. (4) As first shown ...

Meißner (1911) showed how to modify the Reuleaux tetrahedron (which is not a solid of constant width) to form a surface of constant width by replacing three of its edge arcs ...

A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

Let any finite or infinite set of points having no finite limit point be prescribed and associate with each of its points a principal part, i.e., a rational function of the ...

The nth raw moment mu_n^' (i.e., moment about zero) of a distribution P(x) is defined by mu_n^'=<x^n>, (1) where <f(x)>={sumf(x)P(x) discrete distribution; intf(x)P(x)dx ...

The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...

nu(x) = int_0^infty(x^tdt)/(Gamma(t+1)) (1) nu(x,alpha) = int_0^infty(x^(alpha+t)dt)/(Gamma(alpha+t+1)), (2) where Gamma(z) is the gamma function (Erdélyi et al. 1981, p. ...

The ordered pair (s,t), where s is the number of real embeddings of the number field and t is the number of complex-conjugate pairs of embeddings. The degree of the number ...