Search Results for ""

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

A complete multipartite graph is a graph that is a complete k-partite graph for some positive integer k (Chartrand and Zhang 2008, p. 41).

The set P^2 is the set of all equivalence classes [a,b,c] of ordered triples (a,b,c) in C^3\(0,0,0) under the equivalence relation (a,b,c)∼(a^',b^',c^') if ...

Partial differential equation boundary conditions which give the value of the function on a surface, e.g., T=f(r,t).

A Julia set with c=-0.123+0.745i, also known as the dragon fractal.

A parameter n used to specify an elliptic integral of the third kind Pi(n;phi,k).

Define g(k) as the quantity appearing in Waring's problem, then Euler conjectured that g(k)=2^k+|_(3/2)^k_|-2, where |_x_| is the floor function.

The compositeness test consisting of the application of Fermat's little theorem.

A semigroup with a noncommutative product in which no product can ever be expressed more simply in terms of other elements.

When a point P moves along a line through the circumcenter of a given triangle Delta, the pedal circle of P with respect to Delta passes through a fixed point (the Griffiths ...