Search Results for ""

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.

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

The angular distance traveled around a circle is the number of radians the path subtends, theta=l/(2pir)2pi=l/r.

The prime distance pd(n) of a nonnegative integer n is the absolute difference between n and the nearest prime. It is therefore true that pd(p)=0 for primes p. The first few ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

A topological space fulfilling the T_2-axiom: i.e., any two points have disjoint neighborhoods. In the terminology of Alexandroff and Hopf (1972), a T_2-space is called a ...