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 ...

A number of closed-form constants can be obtained for generalized continued fractions having particularly simple partial numerators and denominators. The Ramanujan continued ...

There are a number of attractive polyhedron compounds consisting of five cubes. The first of these (left figures) consists of the arrangement of five cubes in the polyhedron ...

A digit sum s_b(n) is a sum of the base-b digits of n, which can be implemented in the Wolfram Language as DigitSum[n_, b_:10] := Total[IntegerDigits[n, b]]The following ...

A double sum is a series having terms depending on two indices, sum_(i,j)b_(ij). (1) A finite double series can be written as a product of series ...

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 ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

The great icosahedron, not to be confused with the great icosidodecahedron orgreat icosicosidodecahedron, is the Kepler-Poinsot polyhedronhose dual is the great stellated ...

The great rhombicuboctahedron (Cundy and Rowlett 1989, p. 106) is the 26-faced Archimedean solid consisting of faces 12{4}+8{6}+6{8}. It is sometimes called the ...

The great stellated dodecahedron is one of the Kepler-Poinsot polyhedra. It is also the uniform polyhedron with Maeder index 52 (Maeder 1997), Wenninger index 22 (Wenninger ...