Search Results for ""

The Euler triangle formula states that the distance d between the incenter and circumcenter of a triangle is given by d^2=R(R-2r), where R is the circumradius and r is the ...

The graph neighborhood of a vertex v in a graph is the set of all the vertices adjacent to v including v itself. More generally, the ith neighborhood of v is the set of all ...

A univariate distribution proportional to the F-distribution. If the vector d is Gaussian multivariate-distributed with zero mean and unit covariance matrix N_p(0,I) and M is ...

The sphere with respect to which inverse points are computed (i.e., with respect to which geometrical inversion is performed). For example, the cyclides are inversions in a ...

A metric space X is isometric to a metric space Y if there is a bijection f between X and Y that preserves distances. That is, d(a,b)=d(f(a),f(b)). In the context of ...

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

A spherical sector is a solid of revolution enclosed by two radii from the center of a sphere. The spherical sector may either be "open" and have a conical hole (left figure; ...

A tube of radius r of a set gamma is the set of points at a distance r from gamma. In particular, if gamma(t) is a regular space curve whose curvature does not vanish, then ...

A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) (1) for every choice of a satisfying (a,n)=1 (i.e., a and n are ...