TOPICS
Search

Search Results for ""


391 - 400 of 999 for Polytope EdgeSearch Results
The Archimedean duals are the 13 duals of the 13 Archimedean solids, sometimes called the Catalan solids. They are summarized in the following table and illustrated below ...
A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...
The Cayley-Menger determinant is a determinant that gives the volume of a simplex in j dimensions. If S is a j-simplex in R^n with vertices v_1,...,v_(j+1) and B=(beta_(ik)) ...
"Conext 21 polyhedron" is the name given here to the solid underlying the soccer ball of the 2020 Tokyo Olympic Games (held in 2021). It is implemented in the Wolfram ...
The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...
A closed box composed of three pairs of rectangular faces placed opposite each other and joined at right angles to each other, also known as a rectangular parallelepiped. The ...
The deltoidal hexecontahedron is the 60-faced dual polyhedron of the small rhombicosidodecahedron A_5. It is sometimes also called the trapezoidal hexecontahedron (Holden ...
"Escher's solid" is the solid illustrated on the right pedestal in M. C. Escher's Waterfall woodcut (Bool et al. 1982, p. 323). It is obtained by augmenting a rhombic ...
Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...
Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...
1 ... 37|38|39|40|41|42|43 ... 100 Previous Next

...