Search Results for ""

A forgetful functor (also called underlying functor) is defined from a category of algebraic gadgets (groups, Abelian groups, modules, rings, vector spaces, etc.) to the ...

A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

There are two camps of thought on the meaning of general recursive function. One camp considers general recursive functions to be equivalent to the usual recursive functions. ...

Two distinct knots cannot have the same exterior. Or, equivalently, a knot is completely determined by its knot exterior (Cipra 1988; Adams 1994, p. 261). The question was ...

The graph product denoted G-H and defined by the adjacency relations (gadjg^') or (g=g^' and hadjh^'). The graph lexicographic product is also known as the graph composition ...

Graph smoothing, also known as smoothing away or smoothing out, is the process of replacing edges e^'=v_iv_j and e^('')=v_jv_k incident at a vertex v_j of vertex degree 2 by ...

The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...

An edge subdivision is the insertion of a new vertex v_j in the middle of an exiting edge e=v_iv_k accompanied by the joining of the original edge endpoints with the new ...

An extension of a group H by a group N is a group G with a normal subgroup M such that M=N and G/M=H. This information can be encoded into a short exact sequence of groups ...