Search Results for ""

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A fractal curve created from the base curve and motif illustrated above (Lauwerier 1991, p. 37). As illustrated above, the number of segments after the nth iteration is ...

A phenomenon in which a system being forced at an irrational period undergoes rational, periodic motion which persists for a finite range of forcing values. It may occur for ...

By way of analogy with the prime counting function pi(x), the notation pi_(a,b)(x) denotes the number of primes of the form ak+b less than or equal to x (Shanks 1993, pp. ...

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...

A monotone triangle (also called a strict Gelfand pattern or a gog triangle) of order n is a number triangle with n numbers along each side and the base containing entries ...

A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...

A square-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...

A permutation problem invented by Cayley. Let the numbers 1, 2, ..., n be written on a set of cards, and shuffle this deck of cards. Now, start counting using the top card. ...