Search Results for ""

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...

V_t=e^(-ytau)S_tN(d_1)-e^(-rtau)KN(d_2), where N is the cumulative normal distribution and d_1,d_2=(log((S_t)/K)+(r-y+/-1/2sigma^2)tau)/(sigmasqrt(tau)). If y=0, this is the ...

The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

The number of nodes in a graph is called its order.

A hexomino is a 6-polyomino. There are 35 free hexominoes (illustrated above), 60 one-sided hexominoes, and 216 fixed hexominoes.

A formula for the number of Young tableaux associated with a given Ferrers diagram. In each box, write the sum of one plus the number of boxes horizontally to the right and ...

The eight of Hilbert's axioms which concern collinearity and intersection; they include the first four of Euclid's postulates.

An induced subgraph is a subgraph obtained from an original graph by removing a subset of vertices and/or edges together with any edges whose endpoints are both in this ...