Search Results for ""

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

Successive points dividing a golden rectangle into squares lie on a logarithmic spiral (Wells 1991, p. 39; Livio 2002, p. 119) which is sometimes known as the golden spiral. ...

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

Suppose that G is a pseudograph, E is the edge set of G, and C is the family of edge sets of graph cycles of G. Then C obeys the axioms for the circuits of a matroid, and ...

A grid usually refers to two or more infinite sets of evenly-spaced parallel lines at particular angles to each other in a plane, or the intersections of such lines. The two ...

An H-space, named after Heinz Hopf, and sometimes also called a Hopf space, is a topological space together with a continuous binary operation mu:X×X->X, such that there ...

A set of vectors in Euclidean n-space is said to satisfy the Haar condition if every set of n vectors is linearly independent (Cheney 1999). Expressed otherwise, each ...

Any locally compact Hausdorff topological group has a unique (up to scalars) nonzero left invariant measure which is finite on compact sets. If the group is Abelian or ...

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

The Hadamard product is a representation for the Riemann zeta function zeta(s) as a product over its nontrivial zeros rho, ...