Search Results for ""

For every proposition involving logical addition and multiplication ("or" and "and"), there is a corresponding proposition in which the words "addition" and "multiplication" ...

A t-(v,k,lambda) block design (abbreviated t-design) is an incidence structure of points and blocks such that the following hold: 1. There are v points, 2. Each block ...

The minimal polynomial of an algebraic number zeta is the unique irreducible monic polynomial of smallest degree p(x) with rational coefficients such that p(zeta)=0 and whose ...

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

Lagrange's identity is the algebraic identity (sum_(k=1)^na_kb_k)^2=(sum_(k=1)^na_k^2)(sum_(k=1)^nb_k^2)-sum_(1<=k<j<=n)(a_kb_j-a_jb_k)^2 (1) (Mitrinović 1970, p. 41; Marsden ...

The integer sequence defined by the recurrence relation P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=P(1)=P(2)=1. This is the same recurrence relation as for the ...

A vector basis of a vector space V is defined as a subset v_1,...,v_n of vectors in V that are linearly independent and span V. Consequently, if (v_1,v_2,...,v_n) is a list ...

The Alexander polynomial is a knot invariant discovered in 1923 by J. W. Alexander (Alexander 1928). The Alexander polynomial remained the only known knot polynomial until ...

The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...