Search Results for ""

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...

A triangle center (sometimes simply called a center) is a point whose trilinear coordinates are defined in terms of the side lengths and angles of a triangle and for which a ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...

An attractor is a set of states (points in the phase space), invariant under the dynamics, towards which neighboring states in a given basin of attraction asymptotically ...

The bigyrate diminished rhombicosidodecahedron is a convex equilateral solid that is Johnson solid J_(79). The unit bigyrate diminished rhombicosidodecahedron has volume ...

A function f(x) is said to have bounded variation if, over the closed interval x in [a,b], there exists an M such that |f(x_1)-f(a)|+|f(x_2)-f(x_1)|+... +|f(b)-f(x_(n-1))|<=M ...

Due to nonlinearities in weather processes, a butterfly flapping its wings in Tahiti can, in theory, produce a tornado in Kansas. This strong dependence of outcomes on very ...

A set of n variables which fix a geometric object. If the coordinates are distances measured along perpendicular axes, they are known as Cartesian coordinates. The study of ...

A labeled graph whose nodes are indexed by the generators of a Coxeter group having (P_i,P_j) as an graph edge labeled by M_(ij) whenever M_(ij)>2, where M_(ij) is an element ...