Search Results for ""

For a catastrophically unstable recurrence in one direction, any seed values for consecutive x_j and x_(j+1) will converge to the desired sequence of functions in the ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...

The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

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

The unique 1-polyomino, consisting of a single square.

Polynomials s_k(x) which form the Sheffer sequence for f(t)=-(2t)/(1-t^2) (1) and have exponential generating function ...