Search Results for ""
1241 - 1250 of 2012 for Polyhedral graphSearch Results
A polyhedron dissection (or decomposition) is a dissection of one or more polyhedra into other shapes. Two polyhedra can be dissected into each other iff they have equal Dehn ...
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 regular dodecahedron, often simply called "the" dodecahedron, is the Platonic solid composed of 20 polyhedron vertices, 30 polyhedron edges, and 12 pentagonal faces, ...
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.
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 ...
Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...
A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...
...
View search results from all Wolfram sites (12667 matches)

