Search Results for ""

The triangular snake graph TS_n is the graph on n vertices with n odd defined by starting with the path graph P_(n-1) and adding edges (2i-1,2i+1) for i=1, ..., n-1. The ...

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

The truncated pentakis dodecahedral graph, illustrated above in a pair of embeddings, is the skeleton of the truncated pentakis dodecahedron. It has 180 vertices, 270 edges, ...

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...

A real number that is b-normal for every base 2, 3, 4, ... is said to be absolutely normal. As proved by Borel (1922, p. 198), almost all real numbers in [0,1) are absolutely ...

A triangle in which all three angles are acute angles. A triangle which is neither acute nor a right triangle (i.e., it has an obtuse angle) is called an obtuse triangle. ...

Anomalous cancellation is a "canceling" of digits of a and b in the numerator and denominator of a fraction a/b which results in a fraction equal to the original. Note that ...

The antipedal triangle DeltaA^'B^'C^' of a reference triangle DeltaABC with respect to a given point P is the triangle of which DeltaABC is the pedal triangle with respect to ...

The area of a surface or lamina is the amount of material needed to "cover" it completely. The area of a surface or collection of surfaces bounding a solid is called, not ...