Search Results for ""

The multiplicity of a multigraph is its maximum edge multiplicity.

Given two normal subgroups G_1 and G_2 of a group, and two normal subgroups H_1 and H_2 of G_1 and G_2 respectively, H_1(G_1 intersection H_2) is normal in H_1(G_1 ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

There are two definitions of a metacyclic group. 1. A metacyclic group is a group G such that both its commutator subgroup G^' and the quotient group G/G^' are cyclic (Rose ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

A submodule N of a module M that is not the intersection of two submodules of M in which it is properly contained. In other words, for all submodules N_1 and N_2 of M, N=N_1 ...

Let V be a complete normal variety, and write G(V) for the group of divisors, G_n(V) for the group of divisors numerically equal to 0, and G_a(V) the group of divisors ...

The normal bundle of a submanifold N in M is the vector bundle over N that consists of all pairs (x,v), where x is in N and v is a vector in the vector quotient space ...