Search Results for ""

Let {p_n(x)} be orthogonal polynomials associated with the distribution dalpha(x) on the interval [a,b]. Also let rho=c(x-x_1)(x-x_2)...(x-x_l) (for c!=0) be a polynomial of ...

A geometric figure which touches only the vertices (or other extremities) of another figure.

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 clove hitch is the hitch illustrated above that is also called the boatman's knot or peg knot.

The inverse curve of the cochleoid r=(sintheta)/theta (1) with inversion center at the origin and inversion radius k is the quadratrix of Hippias. x = ktcottheta (2) y = kt. ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

A transformation of the form g=D^(T)etaD, where det(D)!=0 and det(D) is the determinant. Isometries are also called congruence transformations.

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...

The cumulative count of property P for a sequence S_n={a_1,a_2,...,a_n} is a sequence of counts of the numbers of elements a_i with i<=k that satisfy P for k=1, 2, ..., n. ...

An algebraic surface which can be represented implicitly by a polynomial of degree 10 in x, y, and z. An example is the Barth decic.