Search Results for ""

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...

Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...

The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...

The conjugate transpose of an m×n matrix A is the n×m matrix defined by A^(H)=A^_^(T), (1) where A^(T) denotes the transpose of the matrix A and A^_ denotes the conjugate ...

The correlation coefficient, sometimes also called the cross-correlation coefficient, Pearson correlation coefficient (PCC), Pearson's r, the Perason product-moment ...

The Euler-Lagrange differential equation is the fundamental equation of calculus of variations. It states that if J is defined by an integral of the form J=intf(t,y,y^.)dt, ...

If x_0 is an ordinary point of the ordinary differential equation, expand y in a Taylor series about x_0. Commonly, the expansion point can be taken as x_0=0, resulting in ...