Search Results for ""

A two-person game where each of the players can take as long as he likes to prepare his move, but the other can take advantage of his hesitation. In this conflict situation, ...

In geometry, an endpoint is one of the two points at the boundary of a line segment. In analysis, an endpoint is one of the two points at the boundary of a closed interval or ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

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

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

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

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...