Search Results for ""

A moment mu_n of a univariate probability density function P(x) taken about the mean mu=mu_1^', mu_n = <(x-<x>)^n> (1) = int(x-mu)^nP(x)dx, (2) where <X> denotes the ...

Let X be a normed space, M and N be algebraically complemented subspaces of X (i.e., M+N=X and M intersection N={0}), pi:X->X/M be the quotient map, phi:M×N->X be the natural ...

The moment of inertia with respect to a given axis of a solid body with density rho(r) is defined by the volume integral I=intrho(r)r__|_^2dV, (1) where r__|_ is the ...

A circle is the set of points in a plane that are equidistant from a given point O. The distance r from the center is called the radius, and the point O is called the center. ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

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 double covering group of the (linear) symplectic group.

The covering of a plane curve with disks of radius epsilon whose centers lie on the curve.

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...