Search Results for ""

In general, a cross is a figure formed by two intersecting line segments. In linear algebra, a cross is defined as a set of n mutually perpendicular pairs of vectors of equal ...

An elliptic fixed point of a differential equation is a fixed point for which the stability matrix has purely imaginary eigenvalues lambda_+/-=+/-iomega (for omega>0). An ...

A hyperbolic fixed point of a differential equation is a fixed point for which the stability matrix has eigenvalues lambda_1<0<lambda_2, also called a saddle point. A ...

Given a system of two ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y), (2) let x_0 and y_0 denote fixed points with x^.=y^.=0, so f(x_0,y_0) = 0 (3) g(x_0,y_0) ...

The regular tetrahedron, often simply called "the" tetrahedron, is the Platonic solid with four polyhedron vertices, six polyhedron edges, and four equivalent equilateral ...

Augmentation is the dual operation of truncation which replaces the faces of a polyhedron with pyramids of height h (where h may be positive, zero, or negative) having the ...

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...

A matching is a maximum matching iff it contains no augmenting path.

The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...

A fork of a tree T is a node of T which is the endpoint of two or more branches.