Search Results for ""

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

For n points in the plane, there are at least N_1=sqrt(n-3/4)-1/2 different distances. The minimum distance can occur only <=3n-6 times, and the maximum distance can occur ...

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

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

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

The spherical distance between two points P and Q on a sphere is the distance of the shortest path along the surface of the sphere (paths that cut through the interior of the ...

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.