Search Results for ""

If A moves along a known curve, then P describes a pursuit curve if P is always directed toward A and A and P move with uniform velocities. Pursuit curves were considered in ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

An affine transformation is any transformation that preserves collinearity (i.e., all points lying on a line initially still lie on a line after transformation) and ratios of ...

A means of describing how one state develops into another state over the course of time. Technically, a dynamical system is a smooth action of the reals or the integers on ...

Lissajous curves are the family of curves described by the parametric equations x(t) = Acos(omega_xt-delta_x) (1) y(t) = Bcos(omega_yt-delta_y), (2) sometimes also written in ...

A surface (or "space") of section, also called a Poincaré section (Rasband 1990, pp. 7 and 93-94), is a way of presenting a trajectory in n-dimensional phase space in an ...

The number d(n) of monotone Boolean functions of n variables (equivalent to one more than the number of antichains on the n-set {1,2,...,n}) is called the nth Dedkind number. ...

"Chaos" is a tricky thing to define. In fact, it is much easier to list properties that a system described as "chaotic" has rather than to give a precise definition of chaos. ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...