Search Results for ""

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

By way of analogy with the eban numbers, uban numbers are defined as numbers whose English names do not contain the letter "u" (i.e., "u" is banned). Note that this ...

A number n which is an integer multiple k of the sum of its unitary divisors sigma^*(n) is called a unitary k-multiperfect number. There are no odd unitary multiperfect ...

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

The Voronov-Neopryatnaya-Dergachev graphs are two graphs on 372 and 972 vertices which have unit-distance embeddings with all vertices on a sphere and chromatic number 5. The ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

A diagram lemma which states that every short exact sequence of chain complexes and chain homomorphisms 0-->C-->^phiD-->^psiE-->0 gives rise to a long exact sequence in ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...

An antisymmetric matrix, also known as a skew-symmetric or antimetric matrix, is a square matrix that satisfies the identity A=-A^(T) (1) where A^(T) is the matrix transpose. ...

A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...