Search Results for ""

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

Complex Analysis

The regular heptagon is the seven-sided regular polygon illustrated above, which has Schläfli symbol {7}. According to Bankoff and Garfunkel (1973), "since the earliest days ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

A symmetric graph is a graph that is both edge- and vertex-transitive (Holton and Sheehan 1993, p. 209). However, care must be taken with this definition since arc-transitive ...

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

The tangential mid-arc triangle of a reference triangle DeltaABC is the triangle DeltaA^'B^'C^' whose sides are the tangents to the incircle at the intersections of the ...

The above topological structure, composed of a countable union of compact sets, is called Alexander's horned sphere. It is homeomorphic with the ball B^3, and its boundary is ...

Let Gamma(z) be the gamma function and n!! denote a double factorial, then [(Gamma(m+1/2))/(Gamma(m))]^2[1/m+(1/2)^21/(m+1)+((1·3)/(2·4))^21/(m+2)+...]_()_(n) ...

A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...