Search Results for ""

A game is defined as a conflict involving gains and losses between two or more opponents who follow formal rules. The study of games belongs to a branch of mathematics known ...

The Gelfond-Schneider constant is the number 2^(sqrt(2))=2.66514414... (OEIS A007507) that is known to be transcendental by Gelfond's theorem. Both the Gelfand-Schneider ...

Given a ring R with identity, the general linear group GL_n(R) is the group of n×n invertible matrices with elements in R. The general linear group GL_n(q) is the set of n×n ...

A triple (a,b,c) of positive integers satisfying a<b<c is said to be geometric if ac=b^2. In particular, such a triple is geometric if its terms form a geometric sequence ...

The girth of a graphs is the length of one of its (if any) shortest graph cycles. Acyclic graphs are considered to have infinite girth (Skiena 1990, p. 191). The girth of a ...

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 coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

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.

The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...