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.

An aliquot sequence computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

Sociable numbers computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

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

An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...

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