Search Results for ""

A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...

A pseudocylindrical map projection which distorts shape, area, scale, and distance to create attractive average projection properties.

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

The placement of n points on a sphere so as to minimize the maximum distance of any point on the sphere from the closest one of the n points.

Consider a horse rider who wishes to feed his horse at a field, gather water from a river, and then return to his tent, all in the smallest overall distance possible. The ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

Differential Geometry

The triangulation point Y of a reference triangle DeltaABC for which triangles DeltaBYC, DeltaCYA, and DeltaAYB have congruent incircles. It is a special case of an Elkies ...

Instead of picking two points from the interior of the cube, instead pick two points on different faces of the unit cube. In this case, the average distance between the ...