Search Results for ""
751 - 760 of 2253 for Halved cube graphSearch Results
The rhombic triacontahedron is a zonohedron which is the dual polyhedron of the icosidodecahedron A_4 (Holden 1971, p. 55). It is Wenninger dual W_(12). It is composed of 30 ...
The great cubicuboctahedron is the uniform polyhedron with Maeder index 14 (Maeder 1997), Wenninger index 77 (Wenninger 1989), Coxeter index 50 (Coxeter et al. 1954), and ...
The deltoidal hexecontahedron is the 60-faced dual polyhedron of the small rhombicosidodecahedron A_5. It is sometimes also called the trapezoidal hexecontahedron (Holden ...
A graph vertex in a graph is said to be an odd node if its vertex degree is odd.
For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...
Construct a 5×5×5 cube from thirteen 1×2×4 blocks, one 2×2×2 block, one 1×2×2, and three 1×1×3 blocks.
The supersphere is the algebraic surface that is the special case of the superellipse with a=b=c. It has equation |x/a|^n+|y/a|^n+|z/a|^n=1 (1) or |x|^n+|y|^n+|z|^n=a^n (2) ...
An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...
A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.
The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.
...
View search results from all Wolfram sites (14149 matches)

