Search Results for ""

Let G be a group having normal subgroups H and K with H subset= K. Then K/H⊴G/H and (G/H)/(K/H)=G/K, where N⊴G indicates that N is a normal subgroup of G and G=H indicates ...

A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

Suppose that A and B are two algebras and M is a unital A-B-bimodule. Then [A M; 0 B]={[a m; 0 b]:a in A,m in M,b in B} with the usual 2×2 matrix-like addition and ...

The vierergruppe is the Abelian abstract group on four elements that is isomorphic to the finite group C2×C2 and the dihedral group D_2. The multiplication table of one ...

The n-wheel complement graph W^__n is the graph complement of the n-wheel graph. For n>4, W^__n is isomorphic to the graph disjoint union of a circulant graph ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

de Rham cohomology is a formal set-up for the analytic problem: If you have a differential k-form omega on a manifold M, is it the exterior derivative of another differential ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...