Search Results for ""

A requirement necessary for a given statement or theorem to hold. Also called a condition.

One name for the figure used by Euclid to prove the Pythagorean theorem.

A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...

Slater (1960, p. 31) terms the identity _4F_3[a,1+1/2a,b,-n; 1/2a,1+a-b;1+a+n]=((1+a)_n(1/2+1/2a-b)_n)/((1/2+1/2a)_n(1+a-b)_n) for n a nonnegative integer the "_4F_3[1] ...

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 Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

The Sherman-Morrison formula is a formula that allows a perturbed matrix to be computed for a change to a given matrix A. If the change can be written in the form u tensor v ...

Two square matrices A and B that are related by B=X^(-1)AX, (1) where X is a square nonsingular matrix are said to be similar. A transformation of the form X^(-1)AX is called ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...