Search Results for ""

A quantitative measure of the simplicity of a geometric construction which reduces geometric constructions to five steps. It was devised by È. Lemoine. S_1 Place a ...

Let S be a set and F={S_1,...,S_p} a nonempty family of distinct nonempty subsets of S whose union is union _(i=1)^pS_i=S. The intersection graph of F is denoted Omega(F) and ...

Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

The group algebra K[G], where K is a field and G a group with the operation *, is the set of all linear combinations of finitely many elements of G with coefficients in K, ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

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 group homomorphism is a map f:G->H between two groups such that the group operation is preserved:f(g_1g_2)=f(g_1)f(g_2) for all g_1,g_2 in G, where the product on the ...

The upper central series of a group G is the sequence of groups (each term normal in the term following it) 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... that is constructed in the ...