Search Results for ""

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

The sum of the values of an integral of the "first" or "second" sort int_(x_0,y_0)^(x_1,y_1)(Pdx)/Q+...+int_(x_0,y_0)^(x_N,y_N)(Pdx)/Q=F(z) and ...

An accumulation point is a point which is the limit of a sequence, also called a limit point. For some maps, periodic orbits give way to chaotic ones beyond a point known as ...

The angle of incidence of a ray to a surface is measured as the difference in angle between the ray and the normal vector of the surface at the point of intersection.

The point of concurrence of the four maltitudes of a cyclic quadrilateral. Let M_(AC) and M_(BD) be the midpoints of the diagonals of a cyclic quadrilateral ABCD, and let P ...

Construct a chain C of 2n components in a solid torus V. Now thicken each component of C slightly to form a chain C_1 of 2n solid tori in V, where pi_1(V-C_1)=pi_1(V-C) via ...

When working over a collection of fields, the base field is the intersection of the fields in the collection, i.e., the field contained in all other fields.