Search Results for ""
441 - 450 of 1536 for Small-World Network Average PathSearch Results
A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...
Over a small neighborhood U of a manifold, a vector bundle is spanned by the local sections defined on U. For example, in a coordinate chart U with coordinates (x_1,...,x_n), ...
A tube of radius r of a set gamma is the set of points at a distance r from gamma. In particular, if gamma(t) is a regular space curve whose curvature does not vanish, then ...
The twist of a ribbon measures how much it twists around its axis and is defined as the integral of the incremental twist around the ribbon. A formula for the twist is given ...
An n-tuple, sometimes simply called a "tuple" when the number n is known implicitly, is another word for a list, i.e., an ordered set of n elements. It can be interpreted as ...
The van der Pol equation is an ordinary differential equation that can be derived from the Rayleigh differential equation by differentiating and setting y=y^'. It is an ...
The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...
A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...
A bitangent is a line that is tangent to a curve at two distinct points. Aa general plane quartic curve has 28 bitangents in the complex projective plane. However, as shown ...
A fundamental system of logic based on the concept of a generalized function whose argument is also a function (Schönfinkel 1924). This mathematical discipline was ...
...
View search results from all Wolfram sites (167717 matches)

