Search Results for ""

The angular acceleration alpha is defined as the time derivative of the angular velocity omega, alpha=(domega)/(dt)=(d^2theta)/(dt^2)z^^=(a)/r.

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

Consider a set of points X_i on an attractor, then the correlation integral is C(l)=lim_(N->infty)1/(N^2)f, where f is the number of pairs (i,j) whose distance |X_i-X_j|<l. ...

Let gamma(t) be a smooth curve in a manifold M from x to y with gamma(0)=x and gamma(1)=y. Then gamma^'(t) in T_(gamma(t)), where T_x is the tangent space of M at x. The ...

The direction from an object A to another object B can be specified as a vector v=AB^-> with tail at A and head at B. However, since this vector has length equal to the ...

Let phi be a map. Then phi is expansive if the statement that the distance d(phi^nx,phi^ny)<delta for all n in Z implies that x=y. Equivalently, phi is expansive if the ...

A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...

Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...