Search Results for ""

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...

The nine-point center N (sometimes instead denoted F) is the center of the nine-point circle. It has equivalent triangle center functions alpha_5 = cos(B-C) (1) alpha_5 = ...

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 ...

Orthogonal circles are orthogonal curves, i.e., they cut one another at right angles. By the Pythagorean theorem, two circles of radii r_1 and r_2 whose centers are a ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

Half of a sphere cut by a plane passing through its center. A hemisphere of radius r can be given by the usual spherical coordinates x = rcosthetasinphi (1) y = ...

AW, AB, and AY in the above figure are in a harmonic range.

A surface of revolution obtained by rotating a closed plane curve about an axis parallel to the plane which does not intersect the curve. The simplest toroid is the torus. ...

Green's theorem is a vector identity which is equivalent to the curl theorem in the plane. Over a region D in the plane with boundary partialD, Green's theorem states ...