Search Results for ""

A function f mapping a set X->X/R (X modulo R), where R is an equivalence relation in X, is called a canonical map.

Every finite group of order n can be represented as a permutation group on n letters, as first proved by Cayley in 1878 (Rotman 1995).

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

A point in a weighted tree that has minimum weight for the tree. The set of all centroid points is called a tree centroid (Harary 1994, p. 36). The largest possible values ...

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

The four following types of groups, 1. linear groups, 2. orthogonal groups, 3. symplectic groups, and 4. unitary groups, which were studied before more exotic types of groups ...

Cohomotopy groups are similar to homotopy groups. A cohomotopy group is a group related to the homotopy classes of maps from a space X into a sphere S^n.

An n-component of a graph G is a maximal n-connected subgraph.

Let L be a link in R^3 and let there be a disk D in the link complement R^3-L. Then a surface F such that D intersects F exactly in its boundary and its boundary does not ...

An ordered pair (a,b) of nonnegative integers such that there is some set of a points and b edges whose removal disconnects the graph and there is no set of a-1 nodes and b ...