Search Results for ""

An integer used to generate a digitaddition. A number can have more than one generator. If a number has no generator, it is called a self number.

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

The digraph union of two digraphs is the digraph whose vertex set (respectively, edge set) is the union of their vertex sets (respectively, edge sets). Given a positive ...

The dihedral group D_2 is a point group that is isomorphic to the vierergruppe and the finite group C_2×C_2.

The shortest path-spanning tree from a graph vertex of a graph.

Informally, a situation in which a decision must be made from several alternatives, none of which is obviously the optimal one. In formal logic, a dilemma is a specific type ...

The dimension of an object is a topological measure of the size of its covering properties. Roughly speaking, it is the number of coordinates needed to specify a point on the ...

One of the Eilenberg-Steenrod axioms. Let X be a single point space. H_n(X)=0 unless n=0, in which case H_0(X)=G where G are some groups. The H_0 are called the coefficients ...

R^n is homeomorphic to R^m iff n=m. This theorem was first proved by Brouwer.

An expansion based on the roots of x^(-n)[xJ_n^'(x)+HJ_n(x)]=0, where J_n(x) is a Bessel function of the first kind, is called a Dini expansion.