Search Results for ""

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

The diminished rhombicosidodecahedron is a convex equilateral solid that is Johnson solid J_(76). This solid is the diminished polyhedron obtained by diminishing a small ...

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

A point where a stable and an unstable separatrix (invariant manifold) from the same fixed point or same family intersect. Therefore, the limits lim_(k->infty)f^k(X) and ...

1000 The medial triambic icosahedron is the dual of the ditrigonal dodecadodecahedron U_(41) and Wenninger dual W_(80), whose outward appearance is the same as the great ...

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

The 60-faced dual polyhedron of the truncated dodecahedron A_(10) (Holden 1971, p. 55) and Wenninger dual W_(10). Wenninger (1989, p. 46) calls the small triambic icosahedron ...

The great dodecahedron is the Kepler-Poinsot polyhedron whose dual is the small stellated dodecahedron. It is also uniform polyhedron with Maeder index 35 (Maeder 1997), ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...

Draw the perpendicular line from the intersection of the two small semicircles in the arbelos. The two circles C_1 and C_2 tangent to this line, the large semicircle, and ...