Search Results for ""

There are at least three definitions of "groupoid" currently in use. The first type of groupoid is an algebraic structure on a set with a binary operator. The only ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

Given a finitely generated Z-graded module M over a graded ring R (finitely generated over R_0, which is an Artinian local ring), the Hilbert function of M is the map ...

An inner product is a generalization of the dot product. In a vector space, it is a way to multiply vectors together, with the result of this multiplication being a scalar. ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...

The logarithmic integral (in the "American" convention; Abramowitz and Stegun 1972; Edwards 2001, p. 26), is defined for real x as li(x) = {int_0^x(dt)/(lnt) for 0<x<1; ...

The Mathieu functions are the solutions to the Mathieu differential equation (d^2V)/(dv^2)+[a-2qcos(2v)]V=0. (1) Even solutions are denoted C(a,q,v) and odd solutions by ...