Search Results for ""

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then Lochs' ...

Let kappa_1 and kappa_2 be the principal curvatures, then their mean H=1/2(kappa_1+kappa_2) (1) is called the mean curvature. Let R_1 and R_2 be the radii corresponding to ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

The radius rho of the midsphere of a polyhedron, also called the interradius. Let P be a point on the original polyhedron and P^' the corresponding point P on the dual. Then ...

A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...

A (general) octahedron is a polyhedron having eight faces. Examples include the 4-trapezohedron, augmented triangular prism (Johnson solid J_(49)), bislit cube, Dürer solid, ...

There are a number of attractive polyhedron compounds consisting of five octahedra. The first octahedron 5-compound is a polyhedron compound composed of five octahedra ...

Let A^' be the outermost vertex of the regular pentagon erected outward on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...