Search Results for ""

The circumcircle is a triangle's circumscribed circle, i.e., the unique circle that passes through each of the triangle's three vertices. The center O of the circumcircle is ...

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

The cubitruncated cuboctahedral graph is the skeleton of the cubitruncated cuboctahedron, which is the only uniform polyhedron for which this is the case. It is illustrated ...

A Diophantine equation is an equation in which only integer solutions are allowed. Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary ...

A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier series make use of the orthogonality relationships of ...

The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written ...

In antiquity, geometric constructions of figures and lengths were restricted to the use of only a straightedge and compass (or in Plato's case, a compass only; a technique ...

Geometry is the study of figures in a space of a given number of dimensions and of a given type. The most common types of geometry are plane geometry (dealing with objects ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...