Search Results for ""

Two nonisomorphic graphs are said to be chromatically equivalent (also termed "chromically equivalent by Bari 1974) if they have identical chromatic polynomials. A graph that ...

An improper use of the symbol sqrt(-1) for the imaginary unit leads to the apparent proof of a false statement. sqrt(-1) = sqrt(-1) (1) sqrt((-1)/1) = sqrt(1/(-1)) (2) ...

An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...

A fallacy is an incorrect result arrived at by apparently correct, though actually specious reasoning. The great Greek geometer Euclid wrote an entire book on geometric ...

In mathematics, a formula is a fact, rule, or principle that is expressed in terms of mathematical symbols. Examples of formulas include equations, equalities, identities, ...

A method of determining coefficients alpha_k in a power series solution y(x)=y_0(x)+sum_(k=1)^nalpha_ky_k(x) of the ordinary differential equation L^~[y(x)]=0 so that ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

The Hodge conjecture asserts that, for particularly nice types of spaces called projective algebraic varieties, the pieces called Hodge cycles are actually rational linear ...

The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...