Search Results for ""

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

The Randić matrix A_(Randic) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=1/(sqrt(d_id_j)), (1) where d_i are the vertex degrees of the graph. In ...

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

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...

A random variable is a measurable function from a probability space (S,S,P) into a measurable space (S^',S^') known as the state space (Doob 1996). Papoulis (1984, p. 88) ...

A random variate is a variable generated from uniformly distributed pseudorandom numbers. Depending on how they are generated, a random variate can be uniformly or ...

In a plane, consider a sum of N two-dimensional vectors with random orientations. Use phasor notation, and let the phase of each vector be random. Assume N unit steps are ...

On a three-dimensional lattice, a random walk has less than unity probability of reaching any point (including the starting point) as the number of steps approaches infinity. ...

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

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...