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

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

Let P and U be points, neither of which lies on a sideline of DeltaABC, given in barycentric coordinates by P=p:q:r and U=u:v:w. The P-reciprocal conjugate of U is then the ...

The reciprocal curve of a given circle is the locus of a point which moves so that its distance from the center of reciprocation varies as its distance from the line which is ...

An auxiliary latitude which gives a sphere having correct distances along the meridians. It is denoted mu (or omega) and is given by mu=(piM)/(2M_p). (1) M_p is evaluated for ...