Search Results for ""

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

Tetrahedron picking is the process of picking tetrahedra at random within a given shape in 3 or higher dimensions. The most natural definition of a random tetrahedron is one ...

The second Steiner circle (a term coined here for the first time) is the circumcircle of the Steiner triangle DeltaS_AS_BS_C. Its center has center function ...

In general, the internal similitude center of two circles C_1=C(x_1,r_1) and C_2=C(x_2,r_2) with centers given in Cartesian coordinates is given by ...

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 outer Napoleon circle, a term coined here for the first time, is the circumcircle of the outer Napoleon triangle. It has center at the triangle centroid G (and is thus ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

The intersection H of the three altitudes AH_A, BH_B, and CH_C of a triangle is called the orthocenter. The name was invented by Besant and Ferrers in 1865 while walking on a ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...