Search Results for ""

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

An ultrametric is a metric which satisfies the following strengthened version of the triangle inequality, d(x,z)<=max(d(x,y),d(y,z)) for all x,y,z. At least two of d(x,y), ...

A 4-polyhex.

Maps between CW-complexes that induce isomorphisms on all homotopy groups are actually homotopy equivalences.

The entire function phi(rho,beta;z)=sum_(k=0)^infty(z^k)/(k!Gamma(rhok+beta)), where rho>-1 and beta in C, named after the British mathematician E. M. Wright.

The connective in logic corresponding to the exclusive nor operation. A XNOR B is equivalent to (A ^ B) v (!A ^ !B), where ^ denotes AND, v denotes OR, and !A denotes NOT. ...

The connective in logic corresponding to the exclusive nor operation. A XNOR B is equivalent to (A ^ B) v (!A ^ !B), where ^ denotes AND, v denotes OR, and !A denotes NOT. ...

A zero function is a function that is almost everywhere zero. The function sometimes known as "the zero function" is the constant function with constant c=0, i.e., f(x)=0 ...

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...