Search Results for ""

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A technically defined group characterizing a system of linear differential equations y_j^'=sum_(k=1)^na_(jk)(x)y_k for j=1, ..., n, where a_(jk) are complex analytic ...

A knot K embedded in R^3=C_z×R_t, where the three-dimensional space R^3 is represented as a direct product of a complex line C with coordinate z and a real line R with ...

Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...

Let Omega be a space with measure mu>=0, and let Phi(P,Q) be a real function on the product space Omega×Omega. When (mu,nu) = intintPhi(P,Q)dmu(Q)dnu(P) (1) = ...

A nonuniform rational B-spline curve defined by C(t)=(sum_(i=0)^(n)N_(i,p)(t)w_iP_i)/(sum_(i=0)^(n)N_(i,p)(t)w_i), where p is the order, N_(i,p) are the B-spline basis ...

A nonuniform rational B-spline surface of degree (p,q) is defined by ...