Search Results for ""

Let a cotree of a spanning tree T in a connected graph G be denoted T^*. Then the edges of G which are not in T^* are called its twigs (Harary 1994, p. 39).

Let graph G have p points v_i and graph H have p points u_i, where p>=3. Then if for each i, the subgraphs G_i=G-v_i and H_i=H-u_i are isomorphic, then the graphs G and H are ...

An R-module M is said to be unital if R is a commutative ring with multiplicative identity 1=1_R and if 1m=m for all elements m in M.

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

The operator e^(nut^2/2) which satisfies e^(nut^2/2)p(x)=1/(sqrt(2pinu))int_(-infty)^inftye^(-u^2/(2nu))p(x+u)du for nu>0.

The satellite knot of an unknot twisted inside a torus.

A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

Let a group G have a group presentation G=<x_1,...,x_n|r_j(x_1,...,x_n),j in J> so that G=F/R, where F is the free group with basis {x_1,...,x_n} and R is the normal subgroup ...