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.

Gradshteyn and Ryzhik (2000) define the circulant determinant by (1) where omega_j is the nth root of unity. The second-order circulant determinant is |x_1 x_2; x_2 ...

Let A be a unital C^*-algebra, then an element u in A is called co-isometry if uu^*=1.

A codeword is an element of an error-correcting code C. If C has length n, then a codeword in C has the form (c_1,c_2,...,c_n), where each c_i is a letter in the alphabet of ...

The cokernel of a group homomorphism f:A-->B of Abelian groups (modules, or abstract vector spaces) is the quotient group (quotient module or quotient space, respectively) ...

Given a Schwarz triangle (p q r), replacing each polygon vertex with its antipodes gives the three colunar spherical triangles (p q^' r^'),(p^' q r^'),(p^' q^' r), (1) where ...

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 conversion of a quadratic polynomial of the form ax^2+bx+c to the form a(x+b/(2a))^2+(c-(b^2)/(4a)), which, defining B=b/2a and C=c-b^2/4a, simplifies to a(x+B)^2+C.

A complex magnification is a map of the form z|->az, where a is a positive real number, which corresponds to magnification about the origin of points in the complex plane by ...

A complex map is a map f:C->C. The following table lists several common types of complex maps. map formula domain complex magnification f(z)=az a in R, a>0 complex rotation ...