Search Results for ""

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

It is always possible to "fairly" divide a cake among n people using only vertical cuts. Furthermore, it is possible to cut and divide a cake such that each person believes ...

An elliptic partial differential equation given by del ^2psi+k^2psi=0, (1) where psi is a scalar function and del ^2 is the scalar Laplacian, or del ^2F+k^2F=0, (2) where F ...

Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

Discrete Mathematics

The pentatope is the simplest regular figure in four dimensions, representing the four-dimensional analog of the solid tetrahedron. It is also called the 5-cell, since it ...