Search Results for ""

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

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

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

The distance between two skew lines with equations x = x_1+(x_2-x_1)s (1) x = x_3+(x_4-x_3)t (2) is given by D=(|(x_3-x_1)·[(x_2-x_1)x(x_4-x_3)]|)/(|(x_2-x_1)x(x_4-x_3)|) (3) ...

The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...

In the case of a general surface, the distance between two points measured along the surface is known as a geodesic. For example, the shortest distance between two points on ...

The equation of a line ax+by+c=0 in slope-intercept form is given by y=-a/bx-c/b, (1) so the line has slope -a/b. Now consider the distance from a point (x_0,y_0) to the ...

Let a line in three dimensions be specified by two points x_1=(x_1,y_1,z_1) and x_2=(x_2,y_2,z_2) lying on it, so a vector along the line is given by v=[x_1+(x_2-x_1)t; ...

In Euclidean space R^3, the curve that minimizes the distance between two points is clearly a straight line segment. This can be shown mathematically as follows using ...

The maximum distance between n points in three dimensions can occur no more than 2n-2 times. Also, there exists a fixed number c such that no distance determined by a set of ...