Search Results for ""

A polynomial function is a function whose values can be expressed in terms of a defining polynomial. A polynomial function of maximum degree 0 is said to be a constant ...

The König-Egeváry theorem, sometimes simply called König's theorem, asserts that the matching number (i.e., size of a maximum independent edge set) is equal to the vertex ...

The natural norm induced by the L2-norm. Let A^(H) be the conjugate transpose of the square matrix A, so that (a_(ij))^(H)=(a^__(ji)), then the spectral norm is defined as ...

The function f(x,y)=(2x^2-y)(y-x^2) which does not have a local maximum at (0, 0), despite criteria commonly touted in the second half of the 1800s which indicated the ...

Suppose f(x) is a function of x that is twice differentiable at a stationary point x_0. 1. If f^('')(x_0)>0, then f has a local minimum at x_0. 2. If f^('')(x_0)<0, then f ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

The apodization function A(x)=1-(x^2)/(a^2). (1) Its full width at half maximum is sqrt(2)a. Its instrument function is I(k) = 2asqrt(2pi)(J_(3/2)(2pika))/((2pika)^(3/2)) (2) ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

The maximum distance between n points in three dimensions can occur no more than 2n-2 times. Also, there exists a fixed number c such that no distance determined by a set of ...