Search Results for ""

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The truncated octahedron is the 14-faced Archimedean solid with faces 8{6}+6{4}. It is also the uniform polyhedron with Maeder index 8 (Maeder 1997), Wenninger index 7 ...

The truncated tetrahedral graph is the cubic Archimedean graph on 12 nodes and 18 edges that is the skeleton of the truncated tetrahedron. It is implemented in the Wolfram ...

Gives a matrix representation b_i of a braid group in terms of (n-1)×(n-1) matrices. A -t always appears in the (i,i) position. b_1 = [-t 0 0 ... 0; -1 1 0 ... 0; 0 0 1 ... ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

Probability and Statistics

The Dürer folium is a special case of the rose curve with n=1. It is therefore also an epitrochoid. It has polar equation r=asin(theta/2) (1) and can be written as a ...

The term perimeter refers either to the curve constituting the boundary of a lamina or else to the length of this boundary. The perimeter of a circle is called the ...

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

The plane figure formed by a sequence of circles C_1, C_2, C_3, ... that are all tangent to each other at the same point and such that the sequence of radii converges to ...