Search Results for ""

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

For any point P on the boundary of an ordinary ball, find a neighborhood of P in which the intersection with the ball's boundary cuts the neighborhood into two parts, each ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

A point which does not lie on at least one ordinary line.

The expected value B_n(s) of r^s from a fixed vertex of a unit n-cube to a point picked at random in the interior of the hypercube is given by B_n(s) = ...

An inflection point is a point on a curve at which the sign of the curvature (i.e., the concavity) changes. Inflection points may be stationary points, but are not local ...

A number x such that for all epsilon>0, there exists a member of the set y different from x such that |y-x|<epsilon. The topological definition of limit point P of A is that ...

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

A metric characterizing the difference between two knots K and K^' in S^3.

The inversive distance is the natural logarithm of the ratio of two concentric circles into which the given circles can be inverted. Let c be the distance between the centers ...