Search Results for ""

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

The minimal polynomial of a matrix A is the monic polynomial in A of smallest degree n such that p(A)=sum_(i=0)^nc_iA^i=0. (1) The minimal polynomial divides any polynomial q ...

There are several statistical quantities called means, e.g., harmonic mean, geometric mean, arithmetic-geometric mean, and root-mean-square. When applied to two elements a ...

The Mellin transform is the integral transform defined by phi(z) = int_0^inftyt^(z-1)f(t)dt (1) f(t) = 1/(2pii)int_(c-iinfty)^(c+iinfty)t^(-z)phi(z)dz. (2) It is implemented ...

The midsphere, also called the intersphere, reciprocating sphere, or inversion sphere, is a sphere with respect to which the polyhedron vertices of a polyhedron are the ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

A 2-dimensional discrete percolation model is said to be mixed if both graph vertices and graph edges may be "blocked" from allowing fluid flow (i.e., closed in the sense of ...

A generalization of calculus of variations which draws the relationship between the stationary points of a smooth real-valued function on a manifold and the global topology ...

A multiple integral is a set of integrals taken over n>1 variables, e.g., int...int_()_(n)f(x_1,...,x_n)dx_1...dx_n. An nth-order integral corresponds, in general, to an ...

A set of four points, one of which is the orthocenter of the other three. In an orthocentric system, each point is the orthocenter of the triangle of the other three, as ...