Search Results for ""

The Moses circle is defined as the circle with center at the Brocard midpoint X_(39) that is tangent to the nine-point circle at the center of the Kiepert hyperbola X_(115). ...

A polyhedral graph having nine vertices. There are 2606 nonisomorphic nonahedral graphs, as first enumerated by Federico (1969; Duijvestijn and Federico 1981). Named ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

A short mnemonic for remembering the first seven decimal digits of pi is "How I wish I could calculate pi" (C. Heckman, pers. comm., Feb. 3, 2005). Eight digits are given by ...

A prime link is a link that cannot be represented as a knot sum of other links. Doll and Hoste (1991) list polynomials for oriented links of nine or fewer crossings, and ...

The irrational constant R = e^(pisqrt(163)) (1) = 262537412640768743.9999999999992500... (2) (OEIS A060295), which is very close to an integer. Numbers such as the Ramanujan ...

There are nine possible types of isolated singularities on a cubic surface, eight of them rational double points. Each type of isolated singularity has an associated normal ...

The regular nonagon is the regular polygon with nine sides and Schläfli symbol {9}. The regular nonagon cannot be constructed using the classical Greek rules of geometric ...

Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...

A circle having a given number of lattice points on its circumference. The Schinzel circle having n lattice points is given by the equation {(x-1/2)^2+y^2=1/45^(k-1) for n=2k ...