Search Results for ""

A group having an infinite number of elements. Some infinite groups, such as the integers or rationals, are not continuous groups.

The sequence generated by repeated application of a map. The map is said to have a closed orbit if it has a finite number of elements.

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

Topological lower bounds in terms of Betti numbers for the number of critical points form a smooth function on a smooth manifold.

The number theta in the quadric (x^2)/(a^2+theta)+(y^2)/(b^2+theta)+(z^2)/(c^2+theta)=1 is called the parameter.

The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...