Search Results for ""

Frucht's theorem states that every finite group is the automorphism group of a finite undirected graph. This was conjectured by König (1936) and proved by Frucht (1939). In ...

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

Any symmetric polynomial (respectively, symmetric rational function) can be expressed as a polynomial (respectively, rational function) in the elementary symmetric ...

Gabriel's horn, also called Torricelli's trumpet, is the surface of revolution of the function y=1/x about the x-axis for x>=1. It is therefore given by parametric equations ...

Let C=C^+ union C^- (where C^+ intersection C^-=emptyset) be the disjoint union of two finite components C^+ and C^-. Let alpha and beta be two involutions on C, each of ...

A generalized Vandermonde matrix of two sequences a and b where a is an increasing sequence of positive integers and b is an increasing sequence of nonnegative integers of ...

Gomoku, also called go-moku (Japanese for "five points") is a tic-tac-toe-like game in which two players alternately place pieces, with each player using pieces of a fixed ...

Gram's law (Hutchinson 1925; Edwards 2001, pp. 125, 127, and 171) is the tendency for zeros of the Riemann-Siegel function Z(t) to alternate with Gram points. Stated more ...

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.