Search Results for ""

The study of number fields by embedding them in a local field is called local class field theory. Information about an equation in a local field may give information about ...

For a Galois extension field K of a field F, the fundamental theorem of Galois theory states that the subgroups of the Galois group G=Gal(K/F) correspond with the subfields ...

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

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

The multiplicity of a multigraph is its maximum edge multiplicity.

von Neumann-Bernays-Gödel set theory (abbreviated "NBG") is a version of set theory which was designed to give the same results as Zermelo-Fraenkel set theory, but in a more ...

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

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

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

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