Search Results for ""

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

A global field is either a number field, a function field on an algebraic curve, or an extension of transcendence degree one over a finite field. From a modern point of view, ...

Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...

A 4×4 magic square in which the elements in each 2×2 corner have the same sum. Dürer's magic square, illustrated above, is an example of a gnomon magic square since the sums ...

A figurate number of the form g_n=2n-1 giving the area of the square gnomon obtained by removing a square of side n-1 from a square of side n, g_n = n^2-(n-1)^2 (1) = 2n-1. ...

The gnomonic projection is a nonconformal map projection obtained by projecting points P_1 (or P_2) on the surface of sphere from a sphere's center O to point P in a plane ...

An illusion in which the eye alternately sees two black faces, or a white goblet.

The Goddard-Henning enneahedron, a term coined here, is the canonical polyhedron obtained from the Goddard-Henning graph. It has 9 vertices, 16 edges (consisting of 3 ...

If T is a set of axioms in a first-order language, and a statement p holds for any structure M satisfying T, then p can be formally deduced from T in some appropriately ...

Gödel's second incompleteness theorem states no consistent axiomatic system which includes Peano arithmetic can prove its own consistency. Stated more colloquially, any ...