Search Results for ""

The Loupekine snarks are the two snarks on 22 vertices and 33 edges illustrated above. They are implemented in the Wolfram Language as GraphData["LoupekineSnark1"] and ...

The mean line segment length l^_ is the average length of a line segment in line segment picking within some given shape. As summarized in the following table (where Delta(3) ...

Napier's bones, also called Napier's rods, are numbered rods which can be used to perform multiplication of any number by a number 2-9. By placing "bones" corresponding to ...

The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...

The Pasch graph is the Levi graph of the Pasch configuration. The Pasch graph is edge-transitive but not vertex-transitive, but fails to be semisymmetric since it is not ...

In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...

Circumscribe a triangle about a circle, another circle around the triangle, a square outside the circle, another circle outside the square, and so on. The circumradius and ...

The Robertson-Wegner graph is of the four (5,5)-cage graphs, also called Robertson's cage (Read and Wilson 1998, p. 273). Like the other (5,5)-cages, the Robertson-Wegner ...

The Robertson graph is the unique (4,5)-cage graph, illustrated above. It has 19 vertices and 38 edges. It has girth 5, diameter 3, chromatic number 3, and is a quartic ...

The Schläfli double sixes graph is the Levi graph of the double sixes configuration.