Search Results for ""

The vertex figure at a vertex V of a polygon is the line segment joining the midpoints of the two adjacent sides meeting at V. For a regular n-gon with side length a, the ...

An inconic with parameters x:y:z=a(b-c):b(c-a):c(a-b), (1) giving equation (2) (Kimberling 1998, pp. 238-239). Its focus is Kimberling center X_(101) and its conic section ...

The first de Villiers point is the perspector of the reference triangle and its BCI triangle, which is Kimberling center X_(1127) and has triangle center function ...

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 class of all regular sequences of particularly well-behaved functions equivalent to a given regular sequence. A distribution is sometimes also called a "generalized ...

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...

The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...

A "beam detector" for a given curve C is defined as a curve (or set of curves) through which every line tangent to or intersecting C passes. The shortest 1-arc beam detector, ...

The cross polytope beta_n is the regular polytope in n dimensions corresponding to the convex hull of the points formed by permuting the coordinates (+/-1, 0, 0, ..., 0). A ...