Search Results for ""

A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

Seymour conjectured that a graph G of order n with minimum vertex degree delta(G)>=kn/(k+1) contains the kth graph power of a Hamiltonian cycle, generalizing Pósa's ...

Significance arithmetic is the arithmetic of approximate numerical quantities that not only keeps track of numerical results, but also uses error propagation to track their ...

In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...

When a number is expressed in scientific notation, the number of significant digits (or significant figures) is the number of digits needed to express the number to within ...

Given a set P with |P|=p elements consisting of c_1 numbers 1, c_2 numbers 2, ..., and c_n numbers n and c_1+c_2+...+c_n=p, find the number of permutations with k-1 rises ...

A siteswap is a sequence encountered in juggling in which each term is a positive integer, encoded in binary. The transition rule from one term to the next consists of ...

To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...

In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...