Search Results for ""

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

There are several different definition of link. In knot theory, a link is one or more disjointly embedded circles in three-space. More informally, a link is an assembly of ...

A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a ...

Tiling of a Möbius strip can be performed immediately by carrying over a tiling of a rectangle with the same two-sided surface area. However, additional tilings are possible ...

In order to integrate a function over a complicated domain D, Monte Carlo integration picks random points over some simple domain D^' which is a superset of D, checks whether ...

An odd number is an integer of the form n=2k+1, where k is an integer. The odd numbers are therefore ..., -3, -1, 1, 3, 5, 7, ... (OEIS A005408), which are also the gnomonic ...

Let (A,<=) and (B,<=) be disjoint totally ordered sets with order types alpha and beta. Then the ordinal sum is defined at set (C=A union B,<=) where, if c_1 and c_2 are both ...