Search Results for ""
1381 - 1390 of 2124 for Archimedean_graphSearch Results
The 12-faced convex deltahedra also known as the Siamese dodecahedron, which is also Johnson solid J_(84). It is implemented in the Wolfram Language as ...
A closed three-dimensional figure (which may, according to some terminology conventions, be self-intersecting). Kern and Bland (1948, p. 18) define a solid as any limited ...
Toroidal functions are a class of functions also called ring functions that appear in systems having toroidal symmetry. Toroidal functions can be expressed in terms of the ...
Truncation is the removal of portions of solids falling outside a set of symmetrically placed planes. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...
The vertex figure at a vertex V of a polygon is the line segment joining the midpoints of the two adjacent sides meeting at V. For a regular n-gon with side length a, the ...
For a connection A and a positive spinor phi in Gamma(V_+), Witten's equations (also called the Seiberg-Witten invariants) are given by D_Aphi = 0 (1) F_+^A = ...
A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...
A q-analog of the Saalschütz theorem due to Jackson is given by where _3phi_2 is the q-hypergeometric function (Koepf 1998, p. 40; Schilling and Warnaar 1999).
There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...
The following table gives the number of nonadjacent vertex pairs k on graphs of n=1, 2, ... vertices. k counts 1 0, 1, 1, 1, 1, 1, 1, ... 2 0, 0, 1, 2, 2, 2, 2, ... 3 0, 0, ...
...
View search results from all Wolfram sites (12750 matches)

