Search Results for ""

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs, including the Herschel graph and the Goldner-Harary ...

The rhombic dodecahedral graph is the Archimedean dual graph which is the skeleton of the rhombic dodecahedron (as well as the Bilinski dodecahedron). It is the Levi graph of ...

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...

The apeirogon is an extension of the definition of regular polygon to a figure with an infinite number of sides. Its Schläfli symbol is {infty}. The apeirogon can produce a ...

There are a number of meanings for the word "arc" in mathematics. In general, an arc is any smooth curve joining two points. The length of an arc is known as its arc length. ...

An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...

Two circles may intersect in two imaginary points, a single degenerate point, or two distinct points. The intersections of two circles determine a line known as the radical ...

A series is said to be convergent if it approaches some limit (D'Angelo and West 2000, p. 259). Formally, the infinite series sum_(n=1)^(infty)a_n is convergent if the ...