Search Results for ""

If X is a locally compact T2-space, then the set C_ degrees(X) of all continuous complex valued functions on X vanishing at infinity (i.e., for each epsilon>0, the set {x in ...

The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_7=f(x_7). Then Hardy's rule approximating the ...

The axioms formulated by Hausdorff (1919) for his concept of a topological space. These axioms describe the properties satisfied by subsets of elements x in a neighborhood ...

Householder (1953) first considered the matrix that now bears his name in the first couple of pages of his book. A Householder matrix for a real vector v can be implemented ...

The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...

Inverse function integration is an indefinite integration technique. While simple, it is an interesting application of integration by parts. If f and f^(-1) are inverses of ...

The inverse haversine function hav^(-1)(z) is defined by hav^(-1)(z)=2sin^(-1)(sqrt(z)). (1) The inverse haversine is implemented in the Wolfram Language as ...