Search Results for ""

A circumconic is a conic section that passes through the vertices of a triangle (Kimberling 1998, p. 235). Every circumconic has a trilinear equation of the form ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

The classic treatise in geometry written by Euclid and used as a textbook for more than 1000 years in western Europe. An Arabic version The Elements appears at the end of the ...

Euler conjectured that at least n nth powers are required for n>2 to provide a sum that is itself an nth power. The conjecture was disproved by Lander and Parkin (1967) with ...

The Foster cage is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Foster cage has 30 nodes. It has 75 edges, diameter 3, girth 5, chromatic number 4, and ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

The dimension e(G), also called the Euclidean dimension (e.g., Buckley and Harary 1988) of a graph, is the smallest dimension n of Euclidean n-space in which G can be ...

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

The ancient Greeks used the 24 letters of their alphabet plus three special signs called episemons--vau or digamma or stigma (6), koppa or qoppa (90), and san or sampi ...