Search Results for ""

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

For a right triangle with legs a and b and hypotenuse c, a^2+b^2=c^2. (1) Many different proofs exist for this most fundamental of all geometric theorems. The theorem can ...

The terms "measure," "measurable," etc. have very precise technical definitions (usually involving sigma-algebras) that can make them appear difficult to understand. However, ...

A theory which satisfies all the Eilenberg-Steenrod axioms with the possible exception of the long exact sequence of a pair axiom, as well as a certain additional continuity ...

Cohomology is an invariant of a topological space, formally "dual" to homology, and so it detects "holes" in a space. Cohomology has more algebraic structure than homology, ...

The symbol used in continental Europe, most of North and South America (with the exception of the United States and Canada), and most of Africa to denote a decimal point, for ...

A binomial coefficient (N; k) is said to be exceptional if lpf(N; k)>N/k. The following table gives the exception binomial coefficients which are also good binomial ...

If, in a plane or spherical convex polygon ABCDEFG, all of whose sides AB, BC, CD, ..., FG (with the exception of AG) have fixed lengths, one simultaneously increases ...

Every nonconstant entire function attains every complex value with at most one exception (Henrici 1988, p. 216; Apostol 1997). Furthermore, every analytic function assumes ...