Search Results for ""

The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.

A number of attractive tetrahedron 6-compounds can be constructed. The first compound (left figures) is obtained by combining three stella octangula. A second can be obtained ...

Let A be a matrix with the elementary divisors of its characteristic matrix expressed as powers of its irreducible polynomials in the field F[lambda], and consider an ...

A homeomorphism, also called a continuous transformation, is an equivalence relation and one-to-one correspondence between points in two geometric figures or topological ...

Attractive compounds of four octahedra can be constructed as the duals of the cube 4-compounds. These compounds will be implemented in a future version of the Wolfram ...

A number of attractive 12-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

An attractive compound of three regular tetrahedra can be obtained by taking three tetrahedra with a C_2 axes aligned along the z-axis and rotating them a sixth of a turn ...

A number of four-tetrahedron compounds can be constructed by rotating about the center-centroid lines of each face. Three such compounds are shown above for rotations by ...

The function frac(x) giving the fractional (noninteger) part of a real number x. The symbol {x} is sometimes used instead of frac(x) (Graham et al. 1994, p. 70; Havil 2003, ...

Number Theory