Search Results for ""

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

The point of concurrence K of the symmedians, sometimes also called the Lemoine point (in England and France) or the Grebe point (in Germany). Equivalently, the symmedian ...

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

Every polynomial equation having complex coefficients and degree >=1 has at least one complex root. This theorem was first proven by Gauss. It is equivalent to the statement ...

The signature of a non-degenerate quadratic form Q=y_1^2+y_2^2+...+y_p^2-y_(p+1)^2-y_(p+2)^2-...-y_r^2 of rank r is most often defined to be the ordered pair (p,q)=(p,r-p) of ...

The surface of revolution obtained by cutting a conical "wedge" with vertex at the center of a sphere out of the sphere. It is therefore a cone plus a spherical cap, and is a ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

The circumcenter is the center O of a triangle's circumcircle. It can be found as the intersection of the perpendicular bisectors. The trilinear coordinates of the ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...