Search Results for ""

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

Dürer's solid, also known as the truncated triangular trapezohedron, is the 8-faced solid depicted in an engraving entitled Melencolia I by Albrecht Dürer (The British ...

The Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

A factorial prime is a prime number of the form n!+/-1, where n! is a factorial. n!-1 is prime for n=3, 4, 6, 7, 12, 14, 30, 32, 33, 38, 94, 166, 324, 379, 469, 546, 974, ...

In a given triangle DeltaABC with all angles less than 120 degrees (2pi/3, the first Fermat point X or F_1 (sometimes simply called "the Fermat point," Torricelli point, or ...

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...