Search Results for ""

An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...

The join G=G_1+G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph union G_1 union G_2 together with all the edges joining ...

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...

Let s_i be the sum of the products of distinct polynomial roots r_j of the polynomial equation of degree n a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the roots are taken ...

The weak law of large numbers (cf. the strong law of large numbers) is a result in probability theory also known as Bernoulli's theorem. Let X_1, ..., X_n be a sequence of ...

A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

The one-dimensional wave equation is given by (partial^2psi)/(partialx^2)=1/(v^2)(partial^2psi)/(partialt^2). (1) In order to specify a wave, the equation is subject to ...

Complex Analysis