Search Results for ""

A Vandermonde matrix is a type of matrix that arises in the polynomial least squares fitting, Lagrange interpolating polynomials (Hoffman and Kunze p. 114), and the ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

Calculus I

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

Let O be an order of an imaginary quadratic field. The class equation of O is the equation H_O=0, where H_O is the extension field minimal polynomial of j(O) over Q, with ...

The Davenport constant of a finite Abelian group G is defined to be the length of the longest minimal zero-system of G and is denoted D(G). Symbolically, ...

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