Search Results for ""
1221 - 1230 of 1987 for Holt graphSearch Results
A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].
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"].
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
Probability is the branch of mathematics that studies the possible outcomes of given events together with the outcomes' relative likelihoods and distributions. In common ...
A curve of constant width constructed by drawing arcs from each polygon vertex of an equilateral triangle between the other two vertices. The Reuleaux triangle has the ...
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 ...
...