TOPICS
Search

Search Results for ""


1111 - 1120 of 1338 for Legendre PolynomialSearch Results
Every nonplanar graph contains either the utility graph K_(3,3) (i.e., the complete bipartite graph on two sets of three vertices) or the pentatope graph K_5 as a ...
Laguerre-Gauss quadrature, also called Gauss-Laguerre quadrature or Laguerre quadrature, is a Gaussian quadrature over the interval [0,infty) with weighting function ...
Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...
The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...
Let P, Q be integers satisfying D=P^2-4Q>0. (1) Then roots of x^2-Px+Q=0 (2) are a = 1/2(P+sqrt(D)) (3) b = 1/2(P-sqrt(D)), (4) so a+b = P (5) ab = 1/4(P^2-D) (6) = Q (7) a-b ...
Let there be three polynomials a(x), b(x), and c(x) with no common factors such that a(x)+b(x)=c(x). Then the number of distinct roots of the three polynomials is one or more ...
The power series that defines the exponential map e^x also defines a map between matrices. In particular, exp(A) = e^(A) (1) = sum_(n=0)^(infty)(A^n)/(n!) (2) = ...
Given a square complex or real matrix A, a matrix norm ||A|| is a nonnegative number associated with A having the properties 1. ||A||>0 when A!=0 and ||A||=0 iff A=0, 2. ...
An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...
The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...
1 ... 109|110|111|112|113|114|115 ... 134 Previous Next

...