Search Results for ""

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

The set closure of the set of arguments of a function f for which f is not zero.

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

Let F_n be the nth Fibonacci number. Then the sequence {F_n}_(n=2)^infty={1,2,3,5,8,...} is complete, even if one is restricted to subsequences in which no two consecutive ...

For a quadratic form Q in the canonical form Q=y_1^2+y_2^2+...+y_p^2-y_(p+1)^2-y_(p+2)^2-...-y_r^2, the rank is the total number r of square terms (both positive and ...

A dimension also called the fractal dimension, Hausdorff dimension, and Hausdorff-Besicovitch dimension in which nonintegral values are permitted. Objects whose capacity ...

In 1750, Benjamin Franklin constructed the above 8×8 semimagic square having magic constant 260. Any half-row or half-column in this square totals 130, and the four corners ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

A set of six.

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...