Search Results for ""

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

The union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

The number of elements in a group G, denoted |G|. If the order of a group is a finite number, the group is said to be a finite group. The order of an element g of a finite ...

The Harary graph H_(k,n) is a particular example of a k-connected graph with n graph vertices having the smallest possible number of edges. The smallest number of edges ...

The haversine, also called the haversed sine, is a little-used entire trigonometric function defined by hav(z) = 1/2vers(z) (1) = 1/2(1-cosz) (2) = sin^2(1/2z), (3) where ...

A Hessenberg decomposition is a matrix decomposition of a matrix A into a unitary matrix P and a Hessenberg matrix H such that PHP^(H)=A, where P^(H) denotes the conjugate ...

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

The hyperfactorial (Sloane and Plouffe 1995) is the function defined by H(n) = K(n+1) (1) = product_(k=1)^(n)k^k, (2) where K(n) is the K-function. The hyperfactorial is ...

The insphere of a solid is a sphere that is tangent to all faces of the solid. An insphere does not always exist, but when it does, its radius r is called the inradius and ...

The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...