Search Results for ""

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

Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...

A q-analog of the Saalschütz theorem due to Jackson is given by where _3phi_2 is the q-hypergeometric function (Koepf 1998, p. 40; Schilling and Warnaar 1999).

In the plane, if a line intersects one side of a triangle and misses the three vertices, then it must intersect one of the other two sides. This is a special case of the ...

For a quadrilateral which is not cyclic, Ptolemy's theorem becomes an inequality: AB×CD+BC×DA>AC×BD. The Ptolemy inequality is still valid when ABCD is a triangular pyramid ...

The Taniyama-Shimura conjecture, since its proof now sometimes known as the modularity theorem, is very general and important conjecture (and now theorem) connecting topology ...

The element in the diagonal of a matrix by which other elements are divided in an algorithm such as Gauss-Jordan elimination is called the pivot element. Partial pivoting is ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

The identity element of an additive group G, usually denoted 0. In the additive group of vectors, the additive identity is the zero vector 0, in the additive group of ...