Search Results for ""

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

The circumcircle is a triangle's circumscribed circle, i.e., the unique circle that passes through each of the triangle's three vertices. The center O of the circumcircle is ...

The diameter of a circle is the distance from a point on the circle to a point pi radians away, and is the maximum distance from one point on a circle to another. The ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...

The Tucker circles are a generalization of the cosine circle and first Lemoine circle which can be viewed as a family of circles obtained by parallel displacing sides of the ...

Given two curves C_1 and C_2 and a fixed point O, let a line from O cut C_1 at Q and C_2 at R. Then the locus of a point P such that OP=QR is the cissoid. The word cissoid ...

Define S_n(x) = sum_(k=1)^(infty)(sin(kx))/(k^n) (1) C_n(x) = sum_(k=1)^(infty)(cos(kx))/(k^n), (2) then the Clausen functions are defined by ...

The divided difference f[x_0,x_1,x_2,...,x_n], sometimes also denoted [x_0,x_1,x_2,...,x_n] (Abramowitz and Stegun 1972), on n+1 points x_0, x_1, ..., x_n of a function f(x) ...

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...