Search Results for ""

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

A tensor-like coefficient which gives the difference between partial derivatives of two coordinates with respect to the other coordinate, ...

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

The covercosine, also called the coversed cosine, is a little-used trigonometric function defined by covercos(z) = vercos(1/2pi-z) (1) = 1+sinz, (2) where vercosz is the ...

A cube 35-compound can be constructed as the dual of the octahedron 35-compound. It will be implemented in a future version of the Wolfram Language as ...

int_0^inftye^(-omegaT)cos(omegat)domega=T/(t^2+T^2), which can be computed using integration by parts.

The dihedral group D_2 is a point group that is isomorphic to the vierergruppe and the finite group C_2×C_2.

For an ellipse given by the parametric equations x = acost (1) y = bsint, (2) the catacaustic is a complicated expression for generic radiant point (x_r,y_r). However, it ...

A metric topology induced by the Euclidean metric. In the Euclidean topology of the n-dimensional space R^n, the open sets are the unions of n-balls. On the real line this ...

A method which can be used to solve any quadratic congruence equation. This technique relies on the fact that solving x^2=b (mod p) is equivalent to finding a value y such ...