Search Results for ""

A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...

The incentral triangle DeltaI_AI_BI_C is the Cevian triangle of a triangle DeltaABC with respect to its incenter I. It is therefore also the triangle whose vertices are ...

The inner Napoleon circle, a term coined here for the first time, is the circumcircle of the inner Napoleon triangle. It has center at the triangle centroid G (and is thus ...

The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...

Kelvin defined the Kelvin functions bei and ber according to ber_nu(x)+ibei_nu(x) = J_nu(xe^(3pii/4)) (1) = e^(nupii)J_nu(xe^(-pii/4)), (2) = e^(nupii/2)I_nu(xe^(pii/4)) (3) ...

The mathematical study of knots. Knot theory considers questions such as the following: 1. Given a tangled loop of string, is it really knotted or can it, with enough ...

The approximation for pi given by pi approx sqrt((40)/3-2sqrt(3)) (1) = 1/3sqrt(120-18sqrt(3)) (2) = 3.141533.... (3) In the above figure, let OA=OF=1, and construct the ...

A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...

Consider the general system of two first-order ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y). (2) Let x_0 and y_0 denote fixed points with x^.=y^.=0, so ...

Little's law states that, under steady state conditions, the average number of items in a queuing system equals the average rate at which the items arrive multiplied by the ...