Search Results for ""

A fractional clique of a graph G is a nonnegative real function on the vertices of G such that sum of the values on the vertices of any independent set is at most one. 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 ...

Denote the nth derivative D^n and the n-fold integral D^(-n). Then D^(-1)f(t)=int_0^tf(xi)dxi. (1) Now, if the equation D^(-n)f(t)=1/((n-1)!)int_0^t(t-xi)^(n-1)f(xi)dxi (2) ...

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...

A transformation of the form w=f(z)=(az+b)/(cz+d), (1) where a, b, c, d in C and ad-bc!=0, (2) is a conformal mapping called a linear fractional transformation. The ...

The solution to the differential equation [D^(2v)+alphaD^v+betaD^0]y(t)=0 (1) is y(t)={e_alpha(t)-e_beta(t) for alpha!=beta; ...

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...

The transformation T(x) = frac(1/x) (1) = 1/x-|_1/x_|, (2) where frac(x) is the fractional part of x and |_x_| is the floor function, that takes a continued fraction ...

There are two sorts of transforms known as the fractional Fourier transform. The linear fractional Fourier transform is a discrete Fourier transform in which the exponent is ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...