Search Results for ""

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

In mathematics, a knot is defined as a closed, non-self-intersecting curve that is embedded in three dimensions and cannot be untangled to produce a simple loop (i.e., the ...

The number of ways a set of n elements can be partitioned into nonempty subsets is called a Bell number and is denoted B_n (not to be confused with the Bernoulli number, ...

The game of billiards is played on a rectangular table (known as a billiard table) upon which balls are placed. One ball (the "cue ball") is then struck with the end of a ...

The conic sections are the nondegenerate curves generated by the intersections of a plane with one or two nappes of a cone. For a plane perpendicular to the axis of the cone, ...

The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...