Search Results for ""

A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...

If two points A and A^' are inverse (sometimes called conjugate) with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to ...

A plot of a function expressed in polar coordinates, with radius r as a function of angle theta. Polar plots can be drawn in the Wolfram Language using PolarPlot[r, {t, tmin, ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

Let a convex polygon be inscribed in a circle and divided into triangles from diagonals from one polygon vertex. The sum of the radii of the circles inscribed in these ...

A polyhedron compound is an arrangement of a number of interpenetrating polyhedra, either all the same or of several distinct types, usually having visually attractive ...

A polyhedron dissection (or decomposition) is a dissection of one or more polyhedra into other shapes. Two polyhedra can be dissected into each other iff they have equal Dehn ...

If P be a point in the plane of an equilateral triangle DeltaABC, then the lengths of line segments AP, BP, and CP correspond the sides of a triangle, which is degenerate ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...