Search Results for ""

The Randić spectral radius rho_(Randic) of a graph is defined as the largest eigenvalue of its Randić matrix.

A random polygon is a polygon generated in some random way. Kendall conjectured that the shape of a random polygon is close to a disk as the area of the polygon becomes large ...

If f:D->Y is a map (a.k.a. function, transformation, etc.) over a domain D, then the range of f, also called the image of D under f, is defined as the set of all values that ...

Let u_k be a series with positive terms and suppose rho=lim_(k->infty)(u_(k+1))/(u_k). Then 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series diverges. ...

A K-rational point is a point (X,Y) on an algebraic curve f(X,Y)=0, where X and Y are in a field K. For example, rational point in the field Q of ordinary rational numbers is ...

A technique for computing eigenfunctions and eigenvalues. It proceeds by requiring J=int_a^b[p(x)y_x^2-q(x)y^2]dx (1) to have a stationary value subject to the normalization ...

y^('')-mu(1-1/3y^('2))y^'+y=0, where mu>0. Differentiating and setting y=y^' gives the van der Pol equation. The equation y^('')-mu(1-y^('2))y^'+y=0 with the 1/3 replaced by ...

The distribution with probability density function and distribution function P(r) = (re^(-r^2/(2s^2)))/(s^2) (1) D(r) = 1-e^(-r^2/(2s^2)) (2) for r in [0,infty) and parameter ...

The Rayleigh functions sigma_n(nu) for n=1, 2, ..., are defined as sigma_n(nu)=sum_(k=1)^inftyj_(nu,k)^(-2n), where +/-j_(nu,k) are the zeros of the Bessel function of the ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...