Search Results for ""

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

There are a number of attractive polyhedron compounds consisting of five cubes. The first of these (left figures) consists of the arrangement of five cubes in the polyhedron ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...

The derivative of a function represents an infinitesimal change in the function with respect to one of its variables. The "simple" derivative of a function f with respect to ...

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

A sphere is defined as the set of all points in three-dimensional Euclidean space R^3 that are located at a distance r (the "radius") from a given point (the "center"). Twice ...

A fractal produced by iteration of the equation z_(n+1)=z_n^2 (mod m) which results in a Moiré-like pattern.

The two-dimensional Euclidean space denoted R^2.

The covering of a plane curve with disks of radius epsilon whose centers lie on the curve.