Search Results for ""

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

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

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 first and second isodynamic points of a triangle DeltaABC can be constructed by drawing the triangle's angle bisectors and exterior angle bisectors. Each pair of ...

Two points which are collinear with respect to a similitude center but are not homologous points. Four interesting theorems from Johnson (1929) follow. 1. Two pairs of ...