Search Results for ""

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...

Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...

A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

A metric on a bunch of segments with a common endpoint O, which defines the distance between two points P_1 and P_2 as the length of the shortest path connecting them inside ...

A shell bounded by two similar ellipsoids having a constant ratio of axes. Given a chord passing through a homeoid, the distance between inner and outer intersections is ...

The point that inversion of a curve is performed with respect to.

The circle with respect to which an inverse curve is computed or relative to which inverse points are computed. In three dimensions, inverse points can be computed relative ...

The radius used in performing an inversion with respect to an inversion circle.