Search Results for ""

The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs ...

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. ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

If the Gauss map of a complete minimal surface omits a neighborhood of the sphere, then the surface is a plane. This was proven by Osserman (1959). Xavier (1981) subsequently ...