Search Results for ""

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...

The far-out point F of a triangle DeltaABC is the inverse point of the triangle centroid with respect to the circumcircle of DeltaABC. For a triangle with side lengths a, b, ...

A circumconic hyperbola, which therefore passes through the orthocenter, is a rectangular hyperbola, and has center on the nine-point circle. Its circumconic parameters are ...

A graph is a forbidden subgraph if its presence as a subgraph of a given graph means it is not a member of some family of graphs. For example, a bipartite graph is a graph ...

The frame bundle on a Riemannian manifold M is a principal bundle. Over every point p in M, the Riemannian metric determines the set of orthonormal frames, i.e., the possible ...

In univariate interpolation, an interpolant is a function L=L(x) which agrees with a particular function f at a set of known points x_0,x_1,x_2,...,x_n and which is used to ...

If any set of points is displaced by X^idx_i where all distance relationships are unchanged (i.e., there is an isometry), then the vector field is called a Killing vector. ...

Let S_n be the sum of n random variates X_i with a Bernoulli distribution with P(X_i=1)=p_i. Then sum_(k=0)^infty|P(S_n=k)-(e^(-lambda)lambda^k)/(k!)|<2sum_(i=1)^np_i^2, ...

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...