Search Results for ""

Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

The mittenpunkt (also called the middlespoint) of a triangle DeltaABC is the symmedian point of the excentral triangle, i.e., the point of concurrence M of the lines from the ...

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 problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...

The primes nearest to the nonnegative integers n=0, 1, 2, ..., assigning ties to the smaller prime, are 2, 2, 2, 3, 3, 5, 5, 7, 7, 7, 11, 11, 11, 13, ... (OEIS A051697). If ...

"Neighborhood" is a word with many different levels of meaning in mathematics. One of the most general concepts of a neighborhood of a point x in R^n (also called an ...

An obelisk is a stone pillar erected as a monument that usually consists of a pyramid atop a tall square (or sometimes rectangular base). The elongated square pyramid can ...

Parallel curves, frequently called "offset curves" in computer graphics applications, are curves which are displaced from a base curve by a constant offset, either positive ...

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...