Search Results for ""
1651 - 1660 of 4277 for Graphing FunctionsSearch Results
A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...
The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...
Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...
Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...
The attractor of the iterated function system given by the set of "fern functions" f_1(x,y) = [0.85 0.04; -0.04 0.85][x; y]+[0.00; 1.60] (1) f_2(x,y) = [-0.15 0.28; 0.26 ...
The base manifold in a bundle is analogous to the domain for a set of functions. In fact, a bundle, by definition, comes with a map to the base manifold, often called pi or ...
The batman curve is a piecewise curve in the shape of the logo of the Batman superhero originally posted on reddit.com on Jul. 28, 2011. It can written as two functions, one ...
If f(x) is piecewise continuous and has a generalized Fourier series sum_(i)a_iphi_i(x) (1) with weighting function w(x), it must be true that ...
Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_5=f(x_5). Then Boole's rule approximating the ...
The only known classically known algebraic curve of curve genus g>1 that has an explicit parametrization (x(t),y(t)) in terms of standard special functions (Burnside 1893, ...
...


