Search Results for ""
1281 - 1290 of 2012 for Polyhedral graphSearch Results
Stellation is the process of constructing polyhedra by extending the facial planes past the polyhedron edges of a given polyhedron until they intersect (Wenninger 1989). The ...
A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...
The cube-octahedron compound is a polyhedron compound composed of a cube and its dual polyhedron, the octahedron. It is implemented in the Wolfram Language as ...
There are a number of formulas variously known as Hurwitz's formula. The first is zeta(1-s,a)=(Gamma(s))/((2pi)^s)[e^(-piis/2)F(a,s)+e^(piis/2)F(-a,s)], where zeta(z,a) is a ...
A class of illusion in which an object which is physically unrealizable is apparently depicted. More than 100 papers have been written about impossible figures (Kulpa 1987), ...
Miller's rules, originally devised to restrict the number of icosahedron stellations to avoid, for example, the occurrence of models that appear identical but have different ...
The 24-cell is a finite regular four-dimensional polytope with Schläfli symbol {3,4,3}. It is also known as the hyperdiamond or icositetrachoron, and is composed of 24 ...
The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...
The term energy has an important physical meaning in physics and is an extremely useful concept. There are several forms energy defined in mathematics. In measure theory, let ...
Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...
...
View search results from all Wolfram sites (12667 matches)

