Search Results for ""

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

65537 is the largest known Fermat prime, and the 65537-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. The 65537-gon has so many ...

A complex function is said to be analytic on a region R if it is complex differentiable at every point in R. The terms holomorphic function, differentiable function, and ...

The area moment of inertia is a property of a two-dimensional plane shape which characterizes its deflection under loading. It is also known as the second moment of area or ...

Intuitively, a model of d-dimensional percolation theory is said to be a Bernoulli model if the open/closed status of an area is completely random. In particular, it makes ...

A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...

A C-matrix is a symmetric (C^(T)=C) or antisymmetric (C^(T)=-C) C_n (-1,0,1)-matrix with diagonal elements 0 and others +/-1 that satisfies CC^(T)=(n-1)I, (1) where I is the ...