Search Results for ""

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 ...

A Hasse diagram is a graphical rendering of a partially ordered set displayed via the cover relation of the partially ordered set with an implied upward orientation. A point ...

A homogeneous ideal I in a graded ring R= direct sum A_i is an ideal generated by a set of homogeneous elements, i.e., each one is contained in only one of the A_i. For ...

The hyperbolic volume of the knot complement of a hyperbolic knot is a knot invariant. Adams (1994) lists the hyperbolic volumes for knots and links. The hyperbolic volume of ...