Search Results for ""

A dyadic, also known as a vector direct product, is a linear polynomial of dyads AB+CD+... consisting of nine components A_(ij) which transform as (A_(ij))^' = ...

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

The Euler-Gergonne-Soddy triangle is the right triangle DeltaZFlEv created by the pairwise intersections of the Euler line L_E, Soddy line L_S, and Gergonne line L_G. (The ...

The study of an extension of derivatives and integrals to noninteger orders. Fractional calculus is based on the definition of the fractional integral as ...

A generalized Vandermonde matrix of two sequences a and b where a is an increasing sequence of positive integers and b is an increasing sequence of nonnegative integers of ...

If T is a set of axioms in a first-order language, and a statement p holds for any structure M satisfying T, then p can be formally deduced from T in some appropriately ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

A number which is simultaneously a heptagonal number H_n and triangular number T_m. Such numbers exist when 1/2n(5n-3)=1/2m(m+1). (1) Completing the square and rearranging ...

A polynomial of the form f(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0 having coefficients a_i that are all integers. An integer polynomial gives integer values for all integer ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...