Search Results for ""

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...

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

The inverse sine is the multivalued function sin^(-1)z (Zwillinger 1995, p. 465), also denoted arcsinz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 307; ...

The Kronecker symbol is an extension of the Jacobi symbol (n/m) to all integers. It is variously written as (n/m) or (n/m) (Cohn 1980; Weiss 1998, p. 236) or (n|m) (Dickson ...

The Laguerre polynomials are solutions L_n(x) to the Laguerre differential equation with nu=0. They are illustrated above for x in [0,1] and n=1, 2, ..., 5, and implemented ...