Search Results for ""
1261 - 1270 of 13134 for Extremal graph theorySearch Results
The Herschel nonahedron is a canonical polyhedron whose skeleton is the Herschel graph. It has 11 vertices, 18 edges, and 9 faces. Of the edges, 6 are short and 12 are long. ...
A plesiohedron is the Voronoi cell of a so-called symmetric Delone set. Plesiohedra are space-filling polyhedra which have special symmetries that take any copy of the ...
The small dodecahemidodecahedron is the uniform polyhedron with Maeder index 51 (Maeder 1997), Wenninger index 91 (Wenninger 1989), Coxeter index 65 (Coxeter et al. 1954), ...
The Loupekine snarks are the two snarks on 22 vertices and 33 edges illustrated above. They are implemented in the Wolfram Language as GraphData["LoupekineSnark1"] and ...
C_4 is one of the two groups of group order 4. Like C_2×C_2, it is Abelian, but unlike C_2×C_2, it is a cyclic. Examples include the point groups C_4 (note that the same ...
An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...
The dihedral group D_4 is one of the two non-Abelian groups of the five groups total of group order 8. It is sometimes called the octic group. An example of D_4 is the ...
A sequence of positive integers 1<=a_1<a_2<a_3<... (1) is a nonaveraging sequence if it contains no three terms which are in an arithmetic progression, i.e., terms such that ...
A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...
The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...
...
View search results from all Wolfram sites (34319 matches)

