Search Results for ""

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

To find the minimum distance between a point in the plane (x_0,y_0) and a quadratic plane curve y=a_0+a_1x+a_2x^2, (1) note that the square of the distance is r^2 = ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

Given a plane ax+by+cz+d=0 (1) and a point x_0=(x_0,y_0,z_0), the normal vector to the plane is given by v=[a; b; c], (2) and a vector from the plane to the point is given by ...

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.