Search Results for ""

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 ...

If there is no integer 0<x<p such that x^2=q (mod p), i.e., if the congruence (35) has no solution, then q is said to be a quadratic nonresidue (mod p). If the congruence ...

The uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...

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 ...

A box integral for dimension n with parameters q and s is defined as the expectation of distance from a fixed point q of a point r chosen at random over the unit n-cube, ...

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

The Cesàro fractal is a fractal also known as the torn square fractal. The base curves and motifs for the two fractals illustrated above are shown below. Starting with a unit ...

A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...