Search Results for ""

A matching is a maximum matching iff it contains no augmenting path.

A fork of a tree T is a node of T which is the endpoint of two or more branches.

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

A metric space X is boundedly compact if all closed bounded subsets of X are compact. Every boundedly compact metric space is complete. (This is a generalization of the ...

The conversion of a quadratic polynomial of the form ax^2+bx+c to the form a(x+b/(2a))^2+(c-(b^2)/(4a)), which, defining B=b/2a and C=c-b^2/4a, simplifies to a(x+B)^2+C.

The circles on the polygon diagonals of a complete quadrilateral as diameters are coaxal. Furthermore, the orthocenters of the four triangles of a complete quadrilateral are ...

An inner product space is a vector space together with an inner product on it. If the inner product defines a complete metric, then the inner product space is called a ...

Two functions f(x) and g(x) are orthogonal over the interval a<=x<=b with weighting function w(x) if <f(x)|g(x)>=int_a^bf(x)g(x)w(x)dx=0. (1) If, in addition, ...

A pair of functions phi_i(x) and phi_j(x) are orthonormal if they are orthogonal and each normalized so that int_a^b[phi_i(x)]^2w(x)dx = 1 (1) int_a^b[phi_j(x)]^2w(x)dx = 1. ...