Search Results for ""

If the three straight lines joining the corresponding vertices of two triangles ABC and A^'B^'C^' all meet in a point (the perspector), then the three intersections of pairs ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

Inversion is the process of transforming points P to a corresponding set of points P^' known as their inverse points. Two points P and P^' are said to be inverses with ...

The circle through the cusp of the arbelos and the tangent points of the first Pappus circle, which is congruent to the two Archimedes' circles. If AB=r and AC=1, then the ...

Let X_1,X_2 subset P^2 be cubic plane curves meeting in nine points p_1, ..., p_9. If X subset P^2 is any cubic containing p_1, ..., p_8, then X contains p_9 as well. It is ...

The conical spiral with angular frequency a on a cone of height h and radius r is a space curve given by the parametric equations x = (h-z)/hrcos(az) (1) y = (h-z)/hrsin(az) ...

Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...