Search Results for ""
1181 - 1190 of 1683 for graphsSearch Results
C_2×C_4 is one of the three Abelian groups of group order 8 (the other two being non-Abelian). Examples include the modulo multiplication groups M_(15), M_(16), M_(20), and ...
A fractal is an object or quantity that displays self-similarity, in a somewhat technical sense, on all scales. The object need not exhibit exactly the same structure at all ...
A fusene is a simple planar 2-connected graph embedded in the plane with all vertices of degree 2 or 3, all bounded faces (not necessarily regular) hexagons, and all vertices ...
A quantitative measure of the simplicity of a geometric construction which reduces geometric constructions to five steps. It was devised by È. Lemoine. S_1 Place a ...
The Goddard-Henning enneahedron, a term coined here, is the canonical polyhedron obtained from the Goddard-Henning graph. It has 9 vertices, 16 edges (consisting of 3 ...
The Goldner-Harary polyhedron is the term given in this work to the polyhedral embedding of the Goldner-Harary graph. This solid is an augmented triangular dipyramid, a ...
A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...
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 d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...
The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...
...
View search results from all Wolfram sites (7140 matches)

