Search Results for ""

The order-n bouquet graph B_n is a pseudograph consisting of a single vertex with n self-loops. The bouquet graph B_1 is a pseudograph that can be considered to correspond to ...

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

In 1850, Bravais demonstrated that crystals were comprised of 14 different types of unit cells: simple cubic, body-centered cubic, face-centered cubic; simple tetragonal, ...

Let X and Y be CW-complexes, and let f:X->Y be a continuous map. Then the cellular approximation theorem states that any such f is homotopic to a cellular map. In fact, if ...

A chamfered octahedron, which could also know known as a tritruncated rhombic dodecahedron, is a polyhedron obtained by chamfering a regular octahedron. The illustration ...

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

A coequalizer of a pair of maps f,g:X->Y in a category is a map c:Y->C such that 1. c degreesf=c degreesg, where degrees denotes composition. 2. For any other map c^':Y->C^' ...

The science of adversarial information protection.

Differential algebra is a field of mathematics that attempts to use methods from abstract algebra to study solutions of systems of polynomial nonlinear ordinary and partial ...

The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...