Search Results for ""

A hexagonal grid is a grid formed by a tessellation of regular hexagons. Boards made of hexagonal grids are often found in strategy and role-playing games because of the lack ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

A decagon is a ten-sided polygon. Several special types of decagons are illustrated above. In particular, a decagon with vertices equally spaced around a circle and with all ...

An injective patch is a patch such that x(u_1,v_1)=x(u_2,v_2) implies that u_1=u_2 and v_1=v_2. An example of a patch which is injective but not regular is the function ...

An octagon is an eight-sided polygon. Several special types of octagons are illustrated above. In particular, an octagon with vertices equally spaced around a circle and with ...